./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 2894ac2f07d93de98abd209517006f1f24ae90d3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-11-28 18:32:31,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:32:31,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:32:31,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:32:31,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:32:31,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:32:31,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:32:31,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:32:31,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:32:31,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:32:31,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:32:31,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:32:31,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:32:31,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:32:31,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:32:31,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:32:31,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:32:31,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:32:31,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:32:31,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:32:31,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:32:31,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:32:31,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:32:31,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:32:31,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:32:31,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:32:31,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:32:31,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:32:31,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:32:31,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:32:31,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:32:31,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:32:31,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:32:31,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:32:31,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:32:31,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:32:31,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:32:31,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:32:31,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:32:31,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:32:31,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:32:31,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:32:31,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:32:31,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:32:31,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:32:31,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:32:31,535 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:32:31,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:32:31,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:32:31,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:32:31,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:32:31,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:32:31,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:32:31,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:32:31,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:32:31,537 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:32:31,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:32:31,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:32:31,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:32:31,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:32:31,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:32:31,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:32:31,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:32:31,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:32:31,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:32:31,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:32:31,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:32:31,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:32:31,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:32:31,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:32:31,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:32:31,542 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 2894ac2f07d93de98abd209517006f1f24ae90d3 [2019-11-28 18:32:31,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:32:31,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:32:31,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:32:31,853 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:32:31,854 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:32:31,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i [2019-11-28 18:32:31,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25499cbfe/46d3b1cc4e7d4029b71d3af8d2fe61c9/FLAG70be23f18 [2019-11-28 18:32:32,467 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:32:32,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i [2019-11-28 18:32:32,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25499cbfe/46d3b1cc4e7d4029b71d3af8d2fe61c9/FLAG70be23f18 [2019-11-28 18:32:32,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25499cbfe/46d3b1cc4e7d4029b71d3af8d2fe61c9 [2019-11-28 18:32:32,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:32:32,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:32:32,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:32:32,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:32:32,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:32:32,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:32:32" (1/1) ... [2019-11-28 18:32:32,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67529377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:32, skipping insertion in model container [2019-11-28 18:32:32,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:32:32" (1/1) ... [2019-11-28 18:32:32,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:32:32,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:32:33,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:32:33,358 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:32:33,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:32:33,540 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:32:33,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33 WrapperNode [2019-11-28 18:32:33,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:32:33,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:32:33,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:32:33,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:32:33,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:32:33,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:32:33,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:32:33,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:32:33,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... [2019-11-28 18:32:33,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:32:33,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:32:33,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:32:33,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:32:33,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:32:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:32:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:32:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:32:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:32:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:32:33,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:32:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:32:33,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:32:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:32:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:32:33,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:32:33,776 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:32:34,489 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:32:34,489 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:32:34,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:32:34 BoogieIcfgContainer [2019-11-28 18:32:34,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:32:34,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:32:34,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:32:34,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:32:34,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:32:32" (1/3) ... [2019-11-28 18:32:34,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9e5b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:32:34, skipping insertion in model container [2019-11-28 18:32:34,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:32:33" (2/3) ... [2019-11-28 18:32:34,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9e5b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:32:34, skipping insertion in model container [2019-11-28 18:32:34,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:32:34" (3/3) ... [2019-11-28 18:32:34,502 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2019-11-28 18:32:34,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:32:34,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:32:34,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:32:34,524 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:32:34,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:32:34,608 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:32:34,630 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:32:34,630 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:32:34,631 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:32:34,631 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:32:34,631 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:32:34,631 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:32:34,632 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:32:34,632 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:32:34,657 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-11-28 18:32:34,660 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-11-28 18:32:34,765 INFO L134 PetriNetUnfolder]: 41/177 cut-off events. [2019-11-28 18:32:34,765 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:32:34,780 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 462 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:32:34,801 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-11-28 18:32:34,847 INFO L134 PetriNetUnfolder]: 41/177 cut-off events. [2019-11-28 18:32:34,848 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:32:34,854 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 462 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:32:34,870 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-11-28 18:32:34,872 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:32:39,363 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-28 18:32:39,480 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-28 18:32:39,513 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47380 [2019-11-28 18:32:39,514 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-11-28 18:32:39,517 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-11-28 18:32:40,088 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-11-28 18:32:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-11-28 18:32:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:32:40,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:40,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:32:40,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:40,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:40,111 INFO L82 PathProgramCache]: Analyzing trace with hash 689103523, now seen corresponding path program 1 times [2019-11-28 18:32:40,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:40,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87197717] [2019-11-28 18:32:40,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:40,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87197717] [2019-11-28 18:32:40,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:40,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:32:40,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893309637] [2019-11-28 18:32:40,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:32:40,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:40,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:32:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:40,526 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-11-28 18:32:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:40,780 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-11-28 18:32:40,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:32:40,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:32:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:40,890 INFO L225 Difference]: With dead ends: 8560 [2019-11-28 18:32:40,891 INFO L226 Difference]: Without dead ends: 8391 [2019-11-28 18:32:40,893 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-11-28 18:32:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-11-28 18:32:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-11-28 18:32:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-11-28 18:32:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-11-28 18:32:41,362 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-11-28 18:32:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:41,362 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-11-28 18:32:41,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:32:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-11-28 18:32:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:32:41,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:41,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:41,366 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:41,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1296433146, now seen corresponding path program 1 times [2019-11-28 18:32:41,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:41,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236692810] [2019-11-28 18:32:41,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:41,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236692810] [2019-11-28 18:32:41,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:41,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:32:41,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692196866] [2019-11-28 18:32:41,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:32:41,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:32:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:32:41,476 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-11-28 18:32:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:41,896 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-11-28 18:32:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:32:41,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:32:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:41,971 INFO L225 Difference]: With dead ends: 13399 [2019-11-28 18:32:41,972 INFO L226 Difference]: Without dead ends: 13392 [2019-11-28 18:32:41,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:32:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-11-28 18:32:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 11787. [2019-11-28 18:32:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11787 states. [2019-11-28 18:32:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 37494 transitions. [2019-11-28 18:32:42,656 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 37494 transitions. Word has length 11 [2019-11-28 18:32:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:42,656 INFO L462 AbstractCegarLoop]: Abstraction has 11787 states and 37494 transitions. [2019-11-28 18:32:42,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:32:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 37494 transitions. [2019-11-28 18:32:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:32:42,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:42,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:42,668 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 825675890, now seen corresponding path program 1 times [2019-11-28 18:32:42,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:42,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009132388] [2019-11-28 18:32:42,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:42,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009132388] [2019-11-28 18:32:42,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:42,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:32:42,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119592949] [2019-11-28 18:32:42,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:32:42,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:42,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:32:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:32:42,803 INFO L87 Difference]: Start difference. First operand 11787 states and 37494 transitions. Second operand 4 states. [2019-11-28 18:32:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:43,078 INFO L93 Difference]: Finished difference Result 14846 states and 46774 transitions. [2019-11-28 18:32:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:32:43,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:32:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:43,131 INFO L225 Difference]: With dead ends: 14846 [2019-11-28 18:32:43,131 INFO L226 Difference]: Without dead ends: 14846 [2019-11-28 18:32:43,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:32:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14846 states. [2019-11-28 18:32:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14846 to 13070. [2019-11-28 18:32:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13070 states. [2019-11-28 18:32:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13070 states to 13070 states and 41519 transitions. [2019-11-28 18:32:43,583 INFO L78 Accepts]: Start accepts. Automaton has 13070 states and 41519 transitions. Word has length 11 [2019-11-28 18:32:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:43,584 INFO L462 AbstractCegarLoop]: Abstraction has 13070 states and 41519 transitions. [2019-11-28 18:32:43,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:32:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 13070 states and 41519 transitions. [2019-11-28 18:32:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:32:43,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:43,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:32:43,589 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 727521173, now seen corresponding path program 1 times [2019-11-28 18:32:43,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:43,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557847148] [2019-11-28 18:32:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:43,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557847148] [2019-11-28 18:32:43,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:43,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:32:43,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764311938] [2019-11-28 18:32:43,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:32:43,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:32:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:32:43,691 INFO L87 Difference]: Start difference. First operand 13070 states and 41519 transitions. Second operand 4 states. [2019-11-28 18:32:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:43,736 INFO L93 Difference]: Finished difference Result 1949 states and 4516 transitions. [2019-11-28 18:32:43,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:32:43,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:32:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:43,742 INFO L225 Difference]: With dead ends: 1949 [2019-11-28 18:32:43,742 INFO L226 Difference]: Without dead ends: 1663 [2019-11-28 18:32:43,743 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-11-28 18:32:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-11-28 18:32:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2019-11-28 18:32:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2019-11-28 18:32:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3725 transitions. [2019-11-28 18:32:43,774 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3725 transitions. Word has length 17 [2019-11-28 18:32:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:43,782 INFO L462 AbstractCegarLoop]: Abstraction has 1663 states and 3725 transitions. [2019-11-28 18:32:43,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:32:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3725 transitions. [2019-11-28 18:32:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 18:32:43,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:43,785 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] [2019-11-28 18:32:43,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1402369775, now seen corresponding path program 1 times [2019-11-28 18:32:43,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:43,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027827429] [2019-11-28 18:32:43,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:43,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027827429] [2019-11-28 18:32:43,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:43,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:32:43,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475251705] [2019-11-28 18:32:43,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:32:43,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:32:43,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:32:43,883 INFO L87 Difference]: Start difference. First operand 1663 states and 3725 transitions. Second operand 5 states. [2019-11-28 18:32:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:43,925 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-11-28 18:32:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:32:43,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 18:32:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:43,926 INFO L225 Difference]: With dead ends: 403 [2019-11-28 18:32:43,927 INFO L226 Difference]: Without dead ends: 357 [2019-11-28 18:32:43,927 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-11-28 18:32:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-28 18:32:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-11-28 18:32:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-28 18:32:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-11-28 18:32:43,934 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-11-28 18:32:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:43,934 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-11-28 18:32:43,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:32:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-11-28 18:32:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:32:43,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:43,937 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] [2019-11-28 18:32:43,937 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:43,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1079059862, now seen corresponding path program 1 times [2019-11-28 18:32:43,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:43,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127772046] [2019-11-28 18:32:43,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:44,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127772046] [2019-11-28 18:32:44,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:44,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:32:44,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025569088] [2019-11-28 18:32:44,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:32:44,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:44,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:32:44,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:44,011 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-11-28 18:32:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:44,063 INFO L93 Difference]: Finished difference Result 332 states and 605 transitions. [2019-11-28 18:32:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:32:44,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:32:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:44,065 INFO L225 Difference]: With dead ends: 332 [2019-11-28 18:32:44,065 INFO L226 Difference]: Without dead ends: 332 [2019-11-28 18:32:44,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-28 18:32:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-11-28 18:32:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-28 18:32:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 601 transitions. [2019-11-28 18:32:44,073 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 601 transitions. Word has length 52 [2019-11-28 18:32:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:44,074 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 601 transitions. [2019-11-28 18:32:44,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:32:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 601 transitions. [2019-11-28 18:32:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:32:44,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:44,078 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] [2019-11-28 18:32:44,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1678296005, now seen corresponding path program 1 times [2019-11-28 18:32:44,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:44,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443568181] [2019-11-28 18:32:44,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:44,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443568181] [2019-11-28 18:32:44,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:44,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:32:44,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572073373] [2019-11-28 18:32:44,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:32:44,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:32:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:44,259 INFO L87 Difference]: Start difference. First operand 328 states and 601 transitions. Second operand 3 states. [2019-11-28 18:32:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:44,307 INFO L93 Difference]: Finished difference Result 327 states and 599 transitions. [2019-11-28 18:32:44,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:32:44,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:32:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:44,309 INFO L225 Difference]: With dead ends: 327 [2019-11-28 18:32:44,309 INFO L226 Difference]: Without dead ends: 327 [2019-11-28 18:32:44,310 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-11-28 18:32:44,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-28 18:32:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 273. [2019-11-28 18:32:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-28 18:32:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 505 transitions. [2019-11-28 18:32:44,317 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 505 transitions. Word has length 52 [2019-11-28 18:32:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:44,319 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 505 transitions. [2019-11-28 18:32:44,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:32:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 505 transitions. [2019-11-28 18:32:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:32:44,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:44,321 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] [2019-11-28 18:32:44,321 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash 768058421, now seen corresponding path program 1 times [2019-11-28 18:32:44,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:44,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382814251] [2019-11-28 18:32:44,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:44,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382814251] [2019-11-28 18:32:44,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:44,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:32:44,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509062358] [2019-11-28 18:32:44,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:32:44,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:32:44,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:32:44,423 INFO L87 Difference]: Start difference. First operand 273 states and 505 transitions. Second operand 3 states. [2019-11-28 18:32:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:44,436 INFO L93 Difference]: Finished difference Result 273 states and 492 transitions. [2019-11-28 18:32:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:32:44,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 18:32:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:44,438 INFO L225 Difference]: With dead ends: 273 [2019-11-28 18:32:44,438 INFO L226 Difference]: Without dead ends: 273 [2019-11-28 18:32:44,439 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-11-28 18:32:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-28 18:32:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-11-28 18:32:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-28 18:32:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 492 transitions. [2019-11-28 18:32:44,444 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 492 transitions. Word has length 53 [2019-11-28 18:32:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:44,445 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 492 transitions. [2019-11-28 18:32:44,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:32:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 492 transitions. [2019-11-28 18:32:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:32:44,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:44,448 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] [2019-11-28 18:32:44,449 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:44,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1826767497, now seen corresponding path program 1 times [2019-11-28 18:32:44,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:44,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060479685] [2019-11-28 18:32:44,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:44,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060479685] [2019-11-28 18:32:44,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:44,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:32:44,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490888075] [2019-11-28 18:32:44,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:32:44,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:32:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:32:44,676 INFO L87 Difference]: Start difference. First operand 273 states and 492 transitions. Second operand 5 states. [2019-11-28 18:32:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:44,728 INFO L93 Difference]: Finished difference Result 463 states and 826 transitions. [2019-11-28 18:32:44,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:32:44,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-28 18:32:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:44,729 INFO L225 Difference]: With dead ends: 463 [2019-11-28 18:32:44,730 INFO L226 Difference]: Without dead ends: 209 [2019-11-28 18:32:44,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:32:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-28 18:32:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-11-28 18:32:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-28 18:32:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-11-28 18:32:44,736 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 54 [2019-11-28 18:32:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:44,736 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-11-28 18:32:44,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:32:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-11-28 18:32:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:32:44,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:44,738 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] [2019-11-28 18:32:44,738 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash 584180705, now seen corresponding path program 2 times [2019-11-28 18:32:44,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:44,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372735781] [2019-11-28 18:32:44,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:45,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-11-28 18:32:45,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372735781] [2019-11-28 18:32:45,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:45,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:32:45,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259744734] [2019-11-28 18:32:45,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 18:32:45,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:45,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 18:32:45,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:32:45,347 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 14 states. [2019-11-28 18:32:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:46,147 INFO L93 Difference]: Finished difference Result 375 states and 638 transitions. [2019-11-28 18:32:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 18:32:46,148 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-11-28 18:32:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:46,149 INFO L225 Difference]: With dead ends: 375 [2019-11-28 18:32:46,149 INFO L226 Difference]: Without dead ends: 343 [2019-11-28 18:32:46,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-11-28 18:32:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-28 18:32:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-11-28 18:32:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-28 18:32:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-11-28 18:32:46,161 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 54 [2019-11-28 18:32:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:46,162 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-11-28 18:32:46,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 18:32:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-11-28 18:32:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:32:46,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:46,163 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] [2019-11-28 18:32:46,163 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1111282689, now seen corresponding path program 3 times [2019-11-28 18:32:46,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:46,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454452946] [2019-11-28 18:32:46,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:32:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:32:46,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454452946] [2019-11-28 18:32:46,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:32:46,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:32:46,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689218883] [2019-11-28 18:32:46,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:32:46,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:32:46,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:32:46,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:32:46,463 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 13 states. [2019-11-28 18:32:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:32:46,852 INFO L93 Difference]: Finished difference Result 411 states and 689 transitions. [2019-11-28 18:32:46,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:32:46,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-11-28 18:32:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:32:46,854 INFO L225 Difference]: With dead ends: 411 [2019-11-28 18:32:46,854 INFO L226 Difference]: Without dead ends: 379 [2019-11-28 18:32:46,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-11-28 18:32:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-28 18:32:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2019-11-28 18:32:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-28 18:32:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-11-28 18:32:46,862 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 54 [2019-11-28 18:32:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:32:46,862 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-11-28 18:32:46,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:32:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-11-28 18:32:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 18:32:46,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:32:46,864 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] [2019-11-28 18:32:46,864 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:32:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:32:46,865 INFO L82 PathProgramCache]: Analyzing trace with hash -695821945, now seen corresponding path program 4 times [2019-11-28 18:32:46,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:32:46,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351887291] [2019-11-28 18:32:46,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:32:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:32:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:32:46,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:32:46,974 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:32:46,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= v_~x$r_buff0_thd0~0_298 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t2479~0.base_19| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19|) |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0)) |v_#memory_int_17|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2479~0.base_19|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19|)) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_~#t2479~0.base=|v_ULTIMATE.start_main_~#t2479~0.base_19|, ULTIMATE.start_main_~#t2479~0.offset=|v_ULTIMATE.start_main_~#t2479~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_20|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2479~0.base, ULTIMATE.start_main_~#t2479~0.offset, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:32:46,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2480~0.base_10|) (= |v_ULTIMATE.start_main_~#t2480~0.offset_9| 0) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10|) |v_ULTIMATE.start_main_~#t2480~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t2480~0.base_10| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2480~0.base_10| 4)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_10|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-11-28 18:32:46,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= P1Thread1of1ForFork1_~arg.offset_Out834970132 |P1Thread1of1ForFork1_#in~arg.offset_In834970132|) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out834970132)) (= ~x$w_buff1~0_Out834970132 ~x$w_buff0~0_In834970132) (= ~x$w_buff0_used~0_Out834970132 1) (= (ite (not (and (not (= 0 (mod ~x$w_buff1_used~0_Out834970132 256))) (not (= 0 (mod ~x$w_buff0_used~0_Out834970132 256))))) 1 0) |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out834970132|) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out834970132| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out834970132) (= P1Thread1of1ForFork1_~arg.base_Out834970132 |P1Thread1of1ForFork1_#in~arg.base_In834970132|) (= ~x$w_buff0~0_Out834970132 2) (= ~x$w_buff0_used~0_In834970132 ~x$w_buff1_used~0_Out834970132)) InVars {~x$w_buff0~0=~x$w_buff0~0_In834970132, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In834970132|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In834970132|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In834970132} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out834970132, ~x$w_buff0~0=~x$w_buff0~0_Out834970132, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out834970132, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out834970132|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out834970132, ~x$w_buff1~0=~x$w_buff1~0_Out834970132, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In834970132|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In834970132|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out834970132, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out834970132} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:32:46,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1026055100 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1026055100| |P0Thread1of1ForFork0_#t~ite3_Out-1026055100|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1026055100 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1026055100| ~x~0_In-1026055100) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= ~x$w_buff1~0_In-1026055100 |P0Thread1of1ForFork0_#t~ite3_Out-1026055100|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1026055100, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1026055100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1026055100, ~x~0=~x~0_In-1026055100} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1026055100|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1026055100|, ~x$w_buff1~0=~x$w_buff1~0_In-1026055100, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1026055100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1026055100, ~x~0=~x~0_In-1026055100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:32:46,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2035957523 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2035957523 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-2035957523| ~x$w_buff0_used~0_In-2035957523)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-2035957523| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2035957523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2035957523} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2035957523|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2035957523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2035957523} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:32:46,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In903252803 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In903252803 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out903252803|) (not .cse1)) (and (= ~x$w_buff0_used~0_In903252803 |P0Thread1of1ForFork0_#t~ite5_Out903252803|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In903252803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In903252803} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out903252803|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In903252803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In903252803} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:32:46,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1408545737 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1408545737 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1408545737 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1408545737 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1408545737|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1408545737 |P0Thread1of1ForFork0_#t~ite6_Out1408545737|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1408545737, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1408545737, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1408545737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1408545737} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1408545737|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1408545737, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1408545737, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1408545737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1408545737} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:32:46,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-343232010 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-343232010 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-343232010| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-343232010| ~x$r_buff0_thd1~0_In-343232010)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-343232010, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-343232010} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-343232010, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-343232010|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-343232010} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:32:46,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1606030513 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1606030513 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1606030513 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1606030513 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1606030513| ~x$r_buff1_thd1~0_In1606030513) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out1606030513| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1606030513, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1606030513, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1606030513, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1606030513} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1606030513, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1606030513|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1606030513, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1606030513, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1606030513} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:32:46,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_34|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:32:46,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In681465490 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In681465490 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In681465490 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In681465490 256)))) (or (and (= ~x$w_buff1_used~0_In681465490 |P1Thread1of1ForFork1_#t~ite12_Out681465490|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out681465490| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In681465490, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In681465490, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In681465490, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681465490} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In681465490, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In681465490, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out681465490|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In681465490, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681465490} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:32:46,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In-838832626 ~x$r_buff0_thd2~0_Out-838832626)) (.cse1 (= (mod ~x$w_buff0_used~0_In-838832626 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-838832626 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out-838832626)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-838832626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-838832626} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-838832626|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-838832626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-838832626} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:32:46,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1212929936 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1212929936 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1212929936 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1212929936 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1212929936 |P1Thread1of1ForFork1_#t~ite14_Out-1212929936|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1212929936|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1212929936, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1212929936, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1212929936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1212929936} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1212929936, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1212929936, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1212929936, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1212929936|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1212929936} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:32:46,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_28|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:32:46,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:32:46,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-356762267 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-356762267 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-356762267| ~x~0_In-356762267) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out-356762267| ~x$w_buff1~0_In-356762267) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-356762267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-356762267, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-356762267, ~x~0=~x~0_In-356762267} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-356762267|, ~x$w_buff1~0=~x$w_buff1~0_In-356762267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-356762267, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-356762267, ~x~0=~x~0_In-356762267} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:32:46,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-11-28 18:32:46,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2145008001 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2145008001 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out2145008001|) (not .cse1)) (and (= ~x$w_buff0_used~0_In2145008001 |ULTIMATE.start_main_#t~ite19_Out2145008001|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2145008001, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2145008001} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2145008001, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2145008001|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2145008001} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:32:46,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1149395453 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1149395453 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1149395453 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1149395453 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1149395453| ~x$w_buff1_used~0_In1149395453) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite20_Out1149395453| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1149395453, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1149395453, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1149395453, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1149395453} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1149395453, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1149395453, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1149395453|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1149395453, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1149395453} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:32:46,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1200748043 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1200748043 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1200748043|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1200748043 |ULTIMATE.start_main_#t~ite21_Out-1200748043|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1200748043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200748043} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1200748043, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1200748043|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200748043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:32:46,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1946532955 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1946532955 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1946532955 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1946532955 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1946532955| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1946532955 |ULTIMATE.start_main_#t~ite22_Out1946532955|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1946532955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1946532955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1946532955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1946532955} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1946532955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1946532955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1946532955, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1946532955|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1946532955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:32:46,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In831027943 256)))) (or (and (= ~x$w_buff1_used~0_In831027943 |ULTIMATE.start_main_#t~ite38_Out831027943|) (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In831027943| |ULTIMATE.start_main_#t~ite37_Out831027943|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out831027943| |ULTIMATE.start_main_#t~ite37_Out831027943|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In831027943 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd0~0_In831027943 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In831027943 256)) (and (= 0 (mod ~x$w_buff1_used~0_In831027943 256)) .cse1))) (= ~x$w_buff1_used~0_In831027943 |ULTIMATE.start_main_#t~ite37_Out831027943|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In831027943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In831027943, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In831027943|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In831027943, ~weak$$choice2~0=~weak$$choice2~0_In831027943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In831027943} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In831027943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In831027943, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out831027943|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out831027943|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In831027943, ~weak$$choice2~0=~weak$$choice2~0_In831027943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In831027943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:32:46,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:32:46,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:32:46,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:32:47,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:32:47 BasicIcfg [2019-11-28 18:32:47,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:32:47,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:32:47,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:32:47,068 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:32:47,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:32:34" (3/4) ... [2019-11-28 18:32:47,072 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:32:47,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= v_~x$r_buff0_thd0~0_298 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t2479~0.base_19| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19|) |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0)) |v_#memory_int_17|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2479~0.base_19|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19|)) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_~#t2479~0.base=|v_ULTIMATE.start_main_~#t2479~0.base_19|, ULTIMATE.start_main_~#t2479~0.offset=|v_ULTIMATE.start_main_~#t2479~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_20|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2479~0.base, ULTIMATE.start_main_~#t2479~0.offset, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:32:47,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2480~0.base_10|) (= |v_ULTIMATE.start_main_~#t2480~0.offset_9| 0) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10|) |v_ULTIMATE.start_main_~#t2480~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t2480~0.base_10| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2480~0.base_10| 4)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_10|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-11-28 18:32:47,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= P1Thread1of1ForFork1_~arg.offset_Out834970132 |P1Thread1of1ForFork1_#in~arg.offset_In834970132|) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out834970132)) (= ~x$w_buff1~0_Out834970132 ~x$w_buff0~0_In834970132) (= ~x$w_buff0_used~0_Out834970132 1) (= (ite (not (and (not (= 0 (mod ~x$w_buff1_used~0_Out834970132 256))) (not (= 0 (mod ~x$w_buff0_used~0_Out834970132 256))))) 1 0) |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out834970132|) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out834970132| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out834970132) (= P1Thread1of1ForFork1_~arg.base_Out834970132 |P1Thread1of1ForFork1_#in~arg.base_In834970132|) (= ~x$w_buff0~0_Out834970132 2) (= ~x$w_buff0_used~0_In834970132 ~x$w_buff1_used~0_Out834970132)) InVars {~x$w_buff0~0=~x$w_buff0~0_In834970132, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In834970132|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In834970132|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In834970132} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out834970132, ~x$w_buff0~0=~x$w_buff0~0_Out834970132, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out834970132, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out834970132|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out834970132, ~x$w_buff1~0=~x$w_buff1~0_Out834970132, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In834970132|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In834970132|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out834970132, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out834970132} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:32:47,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1026055100 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1026055100| |P0Thread1of1ForFork0_#t~ite3_Out-1026055100|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1026055100 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1026055100| ~x~0_In-1026055100) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= ~x$w_buff1~0_In-1026055100 |P0Thread1of1ForFork0_#t~ite3_Out-1026055100|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1026055100, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1026055100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1026055100, ~x~0=~x~0_In-1026055100} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1026055100|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1026055100|, ~x$w_buff1~0=~x$w_buff1~0_In-1026055100, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1026055100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1026055100, ~x~0=~x~0_In-1026055100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:32:47,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2035957523 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2035957523 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-2035957523| ~x$w_buff0_used~0_In-2035957523)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-2035957523| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2035957523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2035957523} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2035957523|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2035957523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2035957523} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-11-28 18:32:47,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In903252803 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In903252803 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out903252803|) (not .cse1)) (and (= ~x$w_buff0_used~0_In903252803 |P0Thread1of1ForFork0_#t~ite5_Out903252803|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In903252803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In903252803} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out903252803|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In903252803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In903252803} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:32:47,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1408545737 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1408545737 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1408545737 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1408545737 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1408545737|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1408545737 |P0Thread1of1ForFork0_#t~ite6_Out1408545737|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1408545737, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1408545737, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1408545737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1408545737} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1408545737|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1408545737, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1408545737, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1408545737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1408545737} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:32:47,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-343232010 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-343232010 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-343232010| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-343232010| ~x$r_buff0_thd1~0_In-343232010)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-343232010, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-343232010} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-343232010, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-343232010|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-343232010} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:32:47,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1606030513 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1606030513 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1606030513 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1606030513 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1606030513| ~x$r_buff1_thd1~0_In1606030513) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out1606030513| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1606030513, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1606030513, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1606030513, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1606030513} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1606030513, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1606030513|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1606030513, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1606030513, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1606030513} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:32:47,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_34|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:32:47,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In681465490 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In681465490 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In681465490 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In681465490 256)))) (or (and (= ~x$w_buff1_used~0_In681465490 |P1Thread1of1ForFork1_#t~ite12_Out681465490|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out681465490| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In681465490, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In681465490, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In681465490, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681465490} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In681465490, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In681465490, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out681465490|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In681465490, ~x$w_buff0_used~0=~x$w_buff0_used~0_In681465490} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:32:47,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In-838832626 ~x$r_buff0_thd2~0_Out-838832626)) (.cse1 (= (mod ~x$w_buff0_used~0_In-838832626 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-838832626 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out-838832626)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-838832626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-838832626} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-838832626|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-838832626, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-838832626} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:32:47,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1212929936 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1212929936 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1212929936 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1212929936 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1212929936 |P1Thread1of1ForFork1_#t~ite14_Out-1212929936|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1212929936|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1212929936, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1212929936, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1212929936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1212929936} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1212929936, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1212929936, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1212929936, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1212929936|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1212929936} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:32:47,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_28|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:32:47,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:32:47,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-356762267 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-356762267 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out-356762267| ~x~0_In-356762267) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out-356762267| ~x$w_buff1~0_In-356762267) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-356762267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-356762267, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-356762267, ~x~0=~x~0_In-356762267} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-356762267|, ~x$w_buff1~0=~x$w_buff1~0_In-356762267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-356762267, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-356762267, ~x~0=~x~0_In-356762267} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-11-28 18:32:47,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-11-28 18:32:47,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2145008001 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2145008001 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out2145008001|) (not .cse1)) (and (= ~x$w_buff0_used~0_In2145008001 |ULTIMATE.start_main_#t~ite19_Out2145008001|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2145008001, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2145008001} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2145008001, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2145008001|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2145008001} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-11-28 18:32:47,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1149395453 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1149395453 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1149395453 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1149395453 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1149395453| ~x$w_buff1_used~0_In1149395453) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite20_Out1149395453| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1149395453, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1149395453, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1149395453, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1149395453} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1149395453, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1149395453, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1149395453|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1149395453, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1149395453} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-11-28 18:32:47,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1200748043 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1200748043 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1200748043|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1200748043 |ULTIMATE.start_main_#t~ite21_Out-1200748043|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1200748043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200748043} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1200748043, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1200748043|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200748043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-11-28 18:32:47,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1946532955 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1946532955 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1946532955 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1946532955 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1946532955| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1946532955 |ULTIMATE.start_main_#t~ite22_Out1946532955|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1946532955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1946532955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1946532955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1946532955} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1946532955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1946532955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1946532955, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1946532955|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1946532955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-11-28 18:32:47,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In831027943 256)))) (or (and (= ~x$w_buff1_used~0_In831027943 |ULTIMATE.start_main_#t~ite38_Out831027943|) (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In831027943| |ULTIMATE.start_main_#t~ite37_Out831027943|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out831027943| |ULTIMATE.start_main_#t~ite37_Out831027943|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In831027943 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd0~0_In831027943 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In831027943 256)) (and (= 0 (mod ~x$w_buff1_used~0_In831027943 256)) .cse1))) (= ~x$w_buff1_used~0_In831027943 |ULTIMATE.start_main_#t~ite37_Out831027943|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In831027943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In831027943, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In831027943|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In831027943, ~weak$$choice2~0=~weak$$choice2~0_In831027943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In831027943} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In831027943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In831027943, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out831027943|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out831027943|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In831027943, ~weak$$choice2~0=~weak$$choice2~0_In831027943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In831027943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:32:47,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:32:47,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:32:47,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-11-28 18:32:47,184 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:32:47,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:32:47,186 INFO L168 Benchmark]: Toolchain (without parser) took 14411.76 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 539.5 MB). Free memory was 948.3 MB in the beginning and 1.2 GB in the end (delta: -238.4 MB). Peak memory consumption was 301.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:47,186 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:32:47,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:47,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:47,188 INFO L168 Benchmark]: Boogie Preprocessor took 65.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:32:47,188 INFO L168 Benchmark]: RCFGBuilder took 797.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:47,189 INFO L168 Benchmark]: TraceAbstraction took 12575.57 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 387.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.7 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:47,190 INFO L168 Benchmark]: Witness Printer took 116.33 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:32:47,192 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 766.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 797.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12575.57 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 387.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.7 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. * Witness Printer took 116.33 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 26 ChoiceCompositions, 3606 VarBasedMoverChecksPositive, 166 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 205 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 47380 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1039 SDtfs, 960 SDslu, 2381 SDs, 0 SdLazy, 1166 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13070occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 3570 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 69362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...