./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi008_tso.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/rfi008_tso.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 4b58e06e0ff3c6a470a6b0069b0c1a47cdc822d5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:47,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:23:47,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:23:47,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:23:47,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:23:47,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:23:47,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:23:47,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:23:47,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:23:47,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:23:47,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:23:47,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:23:47,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:23:47,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:23:47,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:23:47,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:23:47,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:23:47,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:23:47,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:23:47,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:23:47,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:23:47,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:23:47,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:23:47,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:23:47,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:23:47,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:23:47,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:23:47,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:23:47,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:23:47,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:23:47,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:23:47,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:23:47,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:23:47,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:23:47,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:23:47,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:23:47,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:23:47,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:23:47,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:23:47,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:23:47,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:23:47,541 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:23:47,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:23:47,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:23:47,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:23:47,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:23:47,567 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:23:47,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:23:47,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:23:47,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:23:47,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:23:47,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:23:47,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:23:47,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:23:47,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:23:47,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:23:47,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:23:47,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:23:47,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:23:47,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:23:47,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:23:47,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:23:47,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:23:47,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:23:47,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:23:47,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:23:47,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:23:47,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:23:47,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:23:47,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:23:47,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:23:47,576 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 -> 4b58e06e0ff3c6a470a6b0069b0c1a47cdc822d5 [2019-11-28 18:23:47,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:23:47,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:23:47,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:23:47,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:23:47,914 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:23:47,915 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi008_tso.opt.i [2019-11-28 18:23:47,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfe4e321/d28765d0923944f6a367cfc21d0a74d2/FLAG28739d890 [2019-11-28 18:23:48,606 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:23:48,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008_tso.opt.i [2019-11-28 18:23:48,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfe4e321/d28765d0923944f6a367cfc21d0a74d2/FLAG28739d890 [2019-11-28 18:23:48,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cfe4e321/d28765d0923944f6a367cfc21d0a74d2 [2019-11-28 18:23:48,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:23:48,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:23:48,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:48,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:23:48,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:23:48,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ebd404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48, skipping insertion in model container [2019-11-28 18:23:48,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:23:48,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:23:49,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:49,454 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:23:49,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:49,628 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:23:49,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49 WrapperNode [2019-11-28 18:23:49,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:49,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:49,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:23:49,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:23:49,638 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:23:49" (1/1) ... [2019-11-28 18:23:49,660 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:23:49" (1/1) ... [2019-11-28 18:23:49,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:49,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:23:49,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:23:49,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:23:49,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (1/1) ... [2019-11-28 18:23:49,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (1/1) ... [2019-11-28 18:23:49,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (1/1) ... [2019-11-28 18:23:49,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (1/1) ... [2019-11-28 18:23:49,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (1/1) ... [2019-11-28 18:23:49,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (1/1) ... [2019-11-28 18:23:49,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (1/1) ... [2019-11-28 18:23:49,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:23:49,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:23:49,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:23:49,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:23:49,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (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:23:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:23:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:23:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:23:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:23:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:23:49,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:23:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:23:49,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:23:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:23:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:23:49,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:23:49,862 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:23:50,757 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:23:50,758 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:23:50,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:50 BoogieIcfgContainer [2019-11-28 18:23:50,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:23:50,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:23:50,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:23:50,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:23:50,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:23:48" (1/3) ... [2019-11-28 18:23:50,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78380c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:50, skipping insertion in model container [2019-11-28 18:23:50,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:49" (2/3) ... [2019-11-28 18:23:50,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78380c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:50, skipping insertion in model container [2019-11-28 18:23:50,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:50" (3/3) ... [2019-11-28 18:23:50,769 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_tso.opt.i [2019-11-28 18:23:50,780 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:23:50,781 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:23:50,789 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:23:50,791 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:23:50,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,869 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,869 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,870 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:50,931 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:23:50,954 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:23:50,955 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:23:50,955 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:23:50,955 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:23:50,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:23:50,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:23:50,957 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:23:50,960 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:23:50,986 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-11-28 18:23:50,988 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-11-28 18:23:51,102 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-11-28 18:23:51,103 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:51,126 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-11-28 18:23:51,163 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-11-28 18:23:51,244 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-11-28 18:23:51,245 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:51,257 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-11-28 18:23:51,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-11-28 18:23:51,284 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:23:56,122 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 18:23:56,363 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:23:56,477 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:23:56,553 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-11-28 18:23:56,553 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-11-28 18:23:56,557 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-11-28 18:23:58,790 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-11-28 18:23:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-11-28 18:23:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:23:58,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:58,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:23:58,800 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:23:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-11-28 18:23:58,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:58,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225735537] [2019-11-28 18:23:58,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:59,072 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:23:59,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225735537] [2019-11-28 18:23:59,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:59,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:59,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565328578] [2019-11-28 18:23:59,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:59,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:59,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:59,103 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-11-28 18:23:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:59,610 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-11-28 18:23:59,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:59,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:23:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:59,828 INFO L225 Difference]: With dead ends: 25080 [2019-11-28 18:23:59,828 INFO L226 Difference]: Without dead ends: 23470 [2019-11-28 18:23:59,830 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:24:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-11-28 18:24:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-11-28 18:24:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-11-28 18:24:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-11-28 18:24:01,485 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-11-28 18:24:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:01,486 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-11-28 18:24:01,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-11-28 18:24:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:24:01,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:01,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:01,499 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:24:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-11-28 18:24:01,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:01,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264158933] [2019-11-28 18:24:01,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:01,645 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:24:01,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264158933] [2019-11-28 18:24:01,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:01,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:01,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320559800] [2019-11-28 18:24:01,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:01,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:01,649 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-11-28 18:24:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:02,259 INFO L93 Difference]: Finished difference Result 36446 states and 124910 transitions. [2019-11-28 18:24:02,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:02,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:24:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:02,448 INFO L225 Difference]: With dead ends: 36446 [2019-11-28 18:24:02,449 INFO L226 Difference]: Without dead ends: 36430 [2019-11-28 18:24:02,450 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:24:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36430 states. [2019-11-28 18:24:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36430 to 35607. [2019-11-28 18:24:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2019-11-28 18:24:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 122732 transitions. [2019-11-28 18:24:04,383 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 122732 transitions. Word has length 11 [2019-11-28 18:24:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:04,384 INFO L462 AbstractCegarLoop]: Abstraction has 35607 states and 122732 transitions. [2019-11-28 18:24:04,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 122732 transitions. [2019-11-28 18:24:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:24:04,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:04,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:04,389 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:24:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:04,390 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-11-28 18:24:04,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:04,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024749791] [2019-11-28 18:24:04,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:04,507 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:24:04,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024749791] [2019-11-28 18:24:04,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:04,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:04,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261748108] [2019-11-28 18:24:04,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:04,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:04,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:04,511 INFO L87 Difference]: Start difference. First operand 35607 states and 122732 transitions. Second operand 4 states. [2019-11-28 18:24:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:05,030 INFO L93 Difference]: Finished difference Result 46394 states and 157073 transitions. [2019-11-28 18:24:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:05,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:24:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:05,198 INFO L225 Difference]: With dead ends: 46394 [2019-11-28 18:24:05,198 INFO L226 Difference]: Without dead ends: 46379 [2019-11-28 18:24:05,199 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:24:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46379 states. [2019-11-28 18:24:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46379 to 41501. [2019-11-28 18:24:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41501 states. [2019-11-28 18:24:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41501 states to 41501 states and 142005 transitions. [2019-11-28 18:24:07,374 INFO L78 Accepts]: Start accepts. Automaton has 41501 states and 142005 transitions. Word has length 14 [2019-11-28 18:24:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:07,376 INFO L462 AbstractCegarLoop]: Abstraction has 41501 states and 142005 transitions. [2019-11-28 18:24:07,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 41501 states and 142005 transitions. [2019-11-28 18:24:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 18:24:07,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:07,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:07,381 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:24:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-11-28 18:24:07,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:07,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312452788] [2019-11-28 18:24:07,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:07,416 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:24:07,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312452788] [2019-11-28 18:24:07,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:07,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:07,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310532067] [2019-11-28 18:24:07,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:24:07,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:24:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:24:07,419 INFO L87 Difference]: Start difference. First operand 41501 states and 142005 transitions. Second operand 3 states. [2019-11-28 18:24:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:07,770 INFO L93 Difference]: Finished difference Result 67890 states and 222025 transitions. [2019-11-28 18:24:07,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:24:07,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 18:24:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:08,001 INFO L225 Difference]: With dead ends: 67890 [2019-11-28 18:24:08,002 INFO L226 Difference]: Without dead ends: 67890 [2019-11-28 18:24:08,002 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:24:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67890 states. [2019-11-28 18:24:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67890 to 60518. [2019-11-28 18:24:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60518 states. [2019-11-28 18:24:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 201033 transitions. [2019-11-28 18:24:10,690 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 201033 transitions. Word has length 15 [2019-11-28 18:24:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:10,691 INFO L462 AbstractCegarLoop]: Abstraction has 60518 states and 201033 transitions. [2019-11-28 18:24:10,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 201033 transitions. [2019-11-28 18:24:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:24:10,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:10,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:10,699 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:24:10,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1396090736, now seen corresponding path program 1 times [2019-11-28 18:24:10,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:10,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134888100] [2019-11-28 18:24:10,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:10,796 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:24:10,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134888100] [2019-11-28 18:24:10,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:10,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:10,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933262660] [2019-11-28 18:24:10,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:10,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:10,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:10,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:10,799 INFO L87 Difference]: Start difference. First operand 60518 states and 201033 transitions. Second operand 4 states. [2019-11-28 18:24:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:10,879 INFO L93 Difference]: Finished difference Result 9507 states and 25746 transitions. [2019-11-28 18:24:10,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:24:10,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:24:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:10,892 INFO L225 Difference]: With dead ends: 9507 [2019-11-28 18:24:10,892 INFO L226 Difference]: Without dead ends: 5931 [2019-11-28 18:24:10,893 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:24:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2019-11-28 18:24:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5931. [2019-11-28 18:24:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-11-28 18:24:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 13936 transitions. [2019-11-28 18:24:10,994 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 13936 transitions. Word has length 16 [2019-11-28 18:24:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:10,994 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 13936 transitions. [2019-11-28 18:24:10,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 13936 transitions. [2019-11-28 18:24:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:24:10,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:10,996 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:24:10,996 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:24:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-11-28 18:24:10,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:10,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015550913] [2019-11-28 18:24:10,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:11,050 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:24:11,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015550913] [2019-11-28 18:24:11,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:11,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:11,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407294012] [2019-11-28 18:24:11,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:11,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:11,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:11,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:11,053 INFO L87 Difference]: Start difference. First operand 5931 states and 13936 transitions. Second operand 4 states. [2019-11-28 18:24:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:11,321 INFO L93 Difference]: Finished difference Result 7446 states and 17184 transitions. [2019-11-28 18:24:11,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:11,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:24:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:11,334 INFO L225 Difference]: With dead ends: 7446 [2019-11-28 18:24:11,335 INFO L226 Difference]: Without dead ends: 7418 [2019-11-28 18:24:11,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-11-28 18:24:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 5909. [2019-11-28 18:24:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-11-28 18:24:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 13876 transitions. [2019-11-28 18:24:11,443 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 13876 transitions. Word has length 17 [2019-11-28 18:24:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:11,443 INFO L462 AbstractCegarLoop]: Abstraction has 5909 states and 13876 transitions. [2019-11-28 18:24:11,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 13876 transitions. [2019-11-28 18:24:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:24:11,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:11,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:11,451 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:24:11,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2019815131, now seen corresponding path program 1 times [2019-11-28 18:24:11,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:11,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088347411] [2019-11-28 18:24:11,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:11,531 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:24:11,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088347411] [2019-11-28 18:24:11,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:11,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:11,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427350605] [2019-11-28 18:24:11,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:11,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:11,534 INFO L87 Difference]: Start difference. First operand 5909 states and 13876 transitions. Second operand 5 states. [2019-11-28 18:24:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:11,947 INFO L93 Difference]: Finished difference Result 8033 states and 18356 transitions. [2019-11-28 18:24:11,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:24:11,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:24:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:11,960 INFO L225 Difference]: With dead ends: 8033 [2019-11-28 18:24:11,961 INFO L226 Difference]: Without dead ends: 8032 [2019-11-28 18:24:11,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:24:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2019-11-28 18:24:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 7392. [2019-11-28 18:24:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7392 states. [2019-11-28 18:24:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7392 states to 7392 states and 17086 transitions. [2019-11-28 18:24:12,632 INFO L78 Accepts]: Start accepts. Automaton has 7392 states and 17086 transitions. Word has length 28 [2019-11-28 18:24:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:12,632 INFO L462 AbstractCegarLoop]: Abstraction has 7392 states and 17086 transitions. [2019-11-28 18:24:12,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7392 states and 17086 transitions. [2019-11-28 18:24:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:24:12,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:12,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:12,642 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:24:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:12,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1401908326, now seen corresponding path program 1 times [2019-11-28 18:24:12,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:12,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875019863] [2019-11-28 18:24:12,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:12,733 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:24:12,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875019863] [2019-11-28 18:24:12,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:12,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:12,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042959466] [2019-11-28 18:24:12,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:24:12,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:12,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:24:12,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:24:12,735 INFO L87 Difference]: Start difference. First operand 7392 states and 17086 transitions. Second operand 3 states. [2019-11-28 18:24:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:12,825 INFO L93 Difference]: Finished difference Result 7931 states and 17358 transitions. [2019-11-28 18:24:12,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:24:12,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 18:24:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:12,838 INFO L225 Difference]: With dead ends: 7931 [2019-11-28 18:24:12,838 INFO L226 Difference]: Without dead ends: 7931 [2019-11-28 18:24:12,839 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:24:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2019-11-28 18:24:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7375. [2019-11-28 18:24:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-11-28 18:24:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16200 transitions. [2019-11-28 18:24:12,948 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16200 transitions. Word has length 31 [2019-11-28 18:24:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:12,949 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 16200 transitions. [2019-11-28 18:24:12,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16200 transitions. [2019-11-28 18:24:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:24:12,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:12,958 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:12,958 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:24:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1511424135, now seen corresponding path program 1 times [2019-11-28 18:24:12,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:12,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449734316] [2019-11-28 18:24:12,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:13,037 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:24:13,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449734316] [2019-11-28 18:24:13,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:13,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:24:13,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329261003] [2019-11-28 18:24:13,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:13,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:13,039 INFO L87 Difference]: Start difference. First operand 7375 states and 16200 transitions. Second operand 5 states. [2019-11-28 18:24:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:13,094 INFO L93 Difference]: Finished difference Result 4784 states and 10410 transitions. [2019-11-28 18:24:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:13,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 18:24:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:13,101 INFO L225 Difference]: With dead ends: 4784 [2019-11-28 18:24:13,101 INFO L226 Difference]: Without dead ends: 4500 [2019-11-28 18:24:13,102 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:24:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2019-11-28 18:24:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3777. [2019-11-28 18:24:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3777 states. [2019-11-28 18:24:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3777 states to 3777 states and 8426 transitions. [2019-11-28 18:24:13,148 INFO L78 Accepts]: Start accepts. Automaton has 3777 states and 8426 transitions. Word has length 33 [2019-11-28 18:24:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:13,148 INFO L462 AbstractCegarLoop]: Abstraction has 3777 states and 8426 transitions. [2019-11-28 18:24:13,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3777 states and 8426 transitions. [2019-11-28 18:24:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 18:24:13,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:13,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:13,156 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:24:13,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1959930181, now seen corresponding path program 1 times [2019-11-28 18:24:13,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:13,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138616236] [2019-11-28 18:24:13,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:13,278 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:24:13,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138616236] [2019-11-28 18:24:13,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:13,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:24:13,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265435732] [2019-11-28 18:24:13,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:13,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:13,281 INFO L87 Difference]: Start difference. First operand 3777 states and 8426 transitions. Second operand 4 states. [2019-11-28 18:24:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:13,521 INFO L93 Difference]: Finished difference Result 4163 states and 9107 transitions. [2019-11-28 18:24:13,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:24:13,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-28 18:24:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:13,527 INFO L225 Difference]: With dead ends: 4163 [2019-11-28 18:24:13,527 INFO L226 Difference]: Without dead ends: 4163 [2019-11-28 18:24:13,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2019-11-28 18:24:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 4027. [2019-11-28 18:24:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4027 states. [2019-11-28 18:24:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 8831 transitions. [2019-11-28 18:24:13,573 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 8831 transitions. Word has length 58 [2019-11-28 18:24:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:13,573 INFO L462 AbstractCegarLoop]: Abstraction has 4027 states and 8831 transitions. [2019-11-28 18:24:13,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 8831 transitions. [2019-11-28 18:24:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 18:24:13,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:13,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:13,580 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:24:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1263888963, now seen corresponding path program 2 times [2019-11-28 18:24:13,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:13,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083266689] [2019-11-28 18:24:13,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:13,721 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:24:13,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083266689] [2019-11-28 18:24:13,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:13,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:13,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501755980] [2019-11-28 18:24:13,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:24:13,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:24:13,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:24:13,726 INFO L87 Difference]: Start difference. First operand 4027 states and 8831 transitions. Second operand 3 states. [2019-11-28 18:24:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:13,747 INFO L93 Difference]: Finished difference Result 4026 states and 8829 transitions. [2019-11-28 18:24:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:24:13,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-28 18:24:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:13,753 INFO L225 Difference]: With dead ends: 4026 [2019-11-28 18:24:13,753 INFO L226 Difference]: Without dead ends: 4026 [2019-11-28 18:24:13,754 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:24:13,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-11-28 18:24:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3951. [2019-11-28 18:24:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2019-11-28 18:24:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 8696 transitions. [2019-11-28 18:24:13,813 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 8696 transitions. Word has length 58 [2019-11-28 18:24:13,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:13,815 INFO L462 AbstractCegarLoop]: Abstraction has 3951 states and 8696 transitions. [2019-11-28 18:24:13,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 8696 transitions. [2019-11-28 18:24:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 18:24:13,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:13,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:13,824 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:24:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash -848544, now seen corresponding path program 1 times [2019-11-28 18:24:13,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:13,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285788916] [2019-11-28 18:24:13,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:13,979 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:24:13,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285788916] [2019-11-28 18:24:13,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:13,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:24:13,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31240178] [2019-11-28 18:24:13,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:24:13,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:24:13,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:13,981 INFO L87 Difference]: Start difference. First operand 3951 states and 8696 transitions. Second operand 6 states. [2019-11-28 18:24:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:14,366 INFO L93 Difference]: Finished difference Result 4281 states and 9301 transitions. [2019-11-28 18:24:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:24:14,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-28 18:24:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:14,372 INFO L225 Difference]: With dead ends: 4281 [2019-11-28 18:24:14,373 INFO L226 Difference]: Without dead ends: 4281 [2019-11-28 18:24:14,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:24:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2019-11-28 18:24:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4035. [2019-11-28 18:24:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4035 states. [2019-11-28 18:24:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 8829 transitions. [2019-11-28 18:24:14,441 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 8829 transitions. Word has length 59 [2019-11-28 18:24:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:14,441 INFO L462 AbstractCegarLoop]: Abstraction has 4035 states and 8829 transitions. [2019-11-28 18:24:14,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:24:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 8829 transitions. [2019-11-28 18:24:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 18:24:14,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:14,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:14,451 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1198603708, now seen corresponding path program 2 times [2019-11-28 18:24:14,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:14,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393884667] [2019-11-28 18:24:14,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:24:14,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393884667] [2019-11-28 18:24:14,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:14,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:24:14,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936145886] [2019-11-28 18:24:14,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:24:14,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:14,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:24:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:14,569 INFO L87 Difference]: Start difference. First operand 4035 states and 8829 transitions. Second operand 6 states. [2019-11-28 18:24:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:15,022 INFO L93 Difference]: Finished difference Result 5062 states and 10945 transitions. [2019-11-28 18:24:15,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:24:15,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-28 18:24:15,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:15,031 INFO L225 Difference]: With dead ends: 5062 [2019-11-28 18:24:15,031 INFO L226 Difference]: Without dead ends: 5062 [2019-11-28 18:24:15,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:24:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2019-11-28 18:24:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 4174. [2019-11-28 18:24:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-11-28 18:24:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9115 transitions. [2019-11-28 18:24:15,088 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9115 transitions. Word has length 59 [2019-11-28 18:24:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:15,089 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9115 transitions. [2019-11-28 18:24:15,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:24:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9115 transitions. [2019-11-28 18:24:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 18:24:15,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:15,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:15,095 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1500804762, now seen corresponding path program 3 times [2019-11-28 18:24:15,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:15,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390301730] [2019-11-28 18:24:15,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:15,170 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:24:15,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390301730] [2019-11-28 18:24:15,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:15,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:24:15,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176241511] [2019-11-28 18:24:15,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:15,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:15,172 INFO L87 Difference]: Start difference. First operand 4174 states and 9115 transitions. Second operand 5 states. [2019-11-28 18:24:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:15,410 INFO L93 Difference]: Finished difference Result 4979 states and 10650 transitions. [2019-11-28 18:24:15,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:24:15,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-28 18:24:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:15,420 INFO L225 Difference]: With dead ends: 4979 [2019-11-28 18:24:15,420 INFO L226 Difference]: Without dead ends: 4979 [2019-11-28 18:24:15,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:24:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4979 states. [2019-11-28 18:24:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4979 to 4286. [2019-11-28 18:24:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4286 states. [2019-11-28 18:24:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 9343 transitions. [2019-11-28 18:24:15,500 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 9343 transitions. Word has length 59 [2019-11-28 18:24:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:15,501 INFO L462 AbstractCegarLoop]: Abstraction has 4286 states and 9343 transitions. [2019-11-28 18:24:15,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 9343 transitions. [2019-11-28 18:24:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:24:15,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:15,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:15,511 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2015434593, now seen corresponding path program 1 times [2019-11-28 18:24:15,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:15,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357928339] [2019-11-28 18:24:15,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:15,667 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:24:15,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357928339] [2019-11-28 18:24:15,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:15,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:15,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167528306] [2019-11-28 18:24:15,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:15,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:15,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:15,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:15,670 INFO L87 Difference]: Start difference. First operand 4286 states and 9343 transitions. Second operand 4 states. [2019-11-28 18:24:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:15,732 INFO L93 Difference]: Finished difference Result 4743 states and 10310 transitions. [2019-11-28 18:24:15,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:15,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-28 18:24:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:15,740 INFO L225 Difference]: With dead ends: 4743 [2019-11-28 18:24:15,741 INFO L226 Difference]: Without dead ends: 4219 [2019-11-28 18:24:15,741 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:24:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states. [2019-11-28 18:24:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 3812. [2019-11-28 18:24:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3812 states. [2019-11-28 18:24:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 8271 transitions. [2019-11-28 18:24:15,809 INFO L78 Accepts]: Start accepts. Automaton has 3812 states and 8271 transitions. Word has length 60 [2019-11-28 18:24:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:15,809 INFO L462 AbstractCegarLoop]: Abstraction has 3812 states and 8271 transitions. [2019-11-28 18:24:15,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 8271 transitions. [2019-11-28 18:24:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:24:15,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:15,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:15,819 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash -348317429, now seen corresponding path program 2 times [2019-11-28 18:24:15,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:15,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683355526] [2019-11-28 18:24:15,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:15,942 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:24:15,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683355526] [2019-11-28 18:24:15,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:15,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:24:15,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505402701] [2019-11-28 18:24:15,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:15,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:15,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:15,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:15,947 INFO L87 Difference]: Start difference. First operand 3812 states and 8271 transitions. Second operand 5 states. [2019-11-28 18:24:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:15,991 INFO L93 Difference]: Finished difference Result 4263 states and 9228 transitions. [2019-11-28 18:24:15,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:15,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-28 18:24:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:15,993 INFO L225 Difference]: With dead ends: 4263 [2019-11-28 18:24:15,993 INFO L226 Difference]: Without dead ends: 507 [2019-11-28 18:24:15,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-28 18:24:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-11-28 18:24:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-11-28 18:24:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1028 transitions. [2019-11-28 18:24:16,002 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1028 transitions. Word has length 60 [2019-11-28 18:24:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:16,002 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1028 transitions. [2019-11-28 18:24:16,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1028 transitions. [2019-11-28 18:24:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:24:16,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:16,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:16,004 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:16,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash 256933109, now seen corresponding path program 3 times [2019-11-28 18:24:16,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:16,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343474031] [2019-11-28 18:24:16,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:16,131 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:24:16,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343474031] [2019-11-28 18:24:16,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:16,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:24:16,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420465555] [2019-11-28 18:24:16,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:24:16,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:16,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:24:16,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:24:16,133 INFO L87 Difference]: Start difference. First operand 507 states and 1028 transitions. Second operand 8 states. [2019-11-28 18:24:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:16,387 INFO L93 Difference]: Finished difference Result 1034 states and 2101 transitions. [2019-11-28 18:24:16,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:24:16,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-28 18:24:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:16,389 INFO L225 Difference]: With dead ends: 1034 [2019-11-28 18:24:16,389 INFO L226 Difference]: Without dead ends: 727 [2019-11-28 18:24:16,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:24:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-11-28 18:24:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 573. [2019-11-28 18:24:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-11-28 18:24:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1143 transitions. [2019-11-28 18:24:16,401 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1143 transitions. Word has length 60 [2019-11-28 18:24:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:16,401 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1143 transitions. [2019-11-28 18:24:16,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:24:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1143 transitions. [2019-11-28 18:24:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:24:16,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:16,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:16,404 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:16,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 4 times [2019-11-28 18:24:16,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:16,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544485859] [2019-11-28 18:24:16,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:24:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:24:16,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:24:16,563 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:24:16,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1735~0.base_28| 4)) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1735~0.base_28| 1)) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1735~0.base_28|) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= |v_ULTIMATE.start_main_~#t1735~0.offset_20| 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1735~0.base_28|)) (= v_~y$w_buff1~0_192 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1735~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1735~0.base_28|) |v_ULTIMATE.start_main_~#t1735~0.offset_20| 0)) |v_#memory_int_13|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1735~0.base=|v_ULTIMATE.start_main_~#t1735~0.base_28|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_~#t1736~0.base=|v_ULTIMATE.start_main_~#t1736~0.base_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_~#t1735~0.offset=|v_ULTIMATE.start_main_~#t1735~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ULTIMATE.start_main_~#t1736~0.offset=|v_ULTIMATE.start_main_~#t1736~0.offset_14|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1735~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1736~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1735~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1736~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:16,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1736~0.base_13|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1736~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1736~0.base_13| 0)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1736~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1736~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1736~0.base_13|) |v_ULTIMATE.start_main_~#t1736~0.offset_11| 1))) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1736~0.base_13| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1736~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1736~0.base=|v_ULTIMATE.start_main_~#t1736~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1736~0.offset=|v_ULTIMATE.start_main_~#t1736~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1736~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1736~0.offset] because there is no mapped edge [2019-11-28 18:24:16,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:16,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1447142565 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1447142565 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In-1447142565 |P1Thread1of1ForFork1_#t~ite28_Out-1447142565|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1447142565| ~y$w_buff1~0_In-1447142565)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1447142565, ~y$w_buff1~0=~y$w_buff1~0_In-1447142565, ~y$w_buff0~0=~y$w_buff0~0_In-1447142565, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1447142565} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1447142565, ~y$w_buff1~0=~y$w_buff1~0_In-1447142565, ~y$w_buff0~0=~y$w_buff0~0_In-1447142565, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1447142565, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1447142565|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:24:16,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:24:16,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-11-28 18:24:16,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1312315258 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out1312315258| ~y~0_In1312315258) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out1312315258| ~y$mem_tmp~0_In1312315258)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1312315258, ~y$flush_delayed~0=~y$flush_delayed~0_In1312315258, ~y~0=~y~0_In1312315258} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1312315258, ~y$flush_delayed~0=~y$flush_delayed~0_In1312315258, ~y~0=~y~0_In1312315258, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1312315258|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-11-28 18:24:16,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-118865275 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-118865275 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-118865275| ~y$w_buff0_used~0_In-118865275)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-118865275| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-118865275, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118865275} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-118865275, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-118865275|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118865275} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-11-28 18:24:16,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-120250863 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-120250863 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-120250863 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-120250863 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out-120250863| ~y$w_buff1_used~0_In-120250863) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite52_Out-120250863| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-120250863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-120250863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-120250863, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-120250863} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-120250863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-120250863, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-120250863|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-120250863, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-120250863} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-11-28 18:24:16,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-343384870 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In-343384870 ~y$r_buff0_thd2~0_Out-343384870)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-343384870 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-343384870 0) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-343384870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-343384870} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-343384870|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-343384870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-343384870} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:24:16,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1811144977 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1811144977 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1811144977 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1811144977 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite54_Out-1811144977| ~y$r_buff1_thd2~0_In-1811144977) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-1811144977| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1811144977, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811144977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1811144977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1811144977} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1811144977, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811144977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1811144977, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1811144977|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1811144977} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 18:24:16,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:24:16,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1898089960 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-1898089960| ~y$mem_tmp~0_In-1898089960)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out-1898089960| ~y~0_In-1898089960) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1898089960, ~y$flush_delayed~0=~y$flush_delayed~0_In-1898089960, ~y~0=~y~0_In-1898089960} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1898089960, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1898089960|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1898089960, ~y~0=~y~0_In-1898089960} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-11-28 18:24:16,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:24:16,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:24:16,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1932374414 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1932374414 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In1932374414 |ULTIMATE.start_main_#t~ite57_Out1932374414|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In1932374414 |ULTIMATE.start_main_#t~ite57_Out1932374414|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1932374414, ~y~0=~y~0_In1932374414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1932374414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932374414} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1932374414, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1932374414|, ~y~0=~y~0_In1932374414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1932374414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932374414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-11-28 18:24:16,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-11-28 18:24:16,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2023057287 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2023057287 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out2023057287|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out2023057287| ~y$w_buff0_used~0_In2023057287)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2023057287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2023057287} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2023057287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2023057287, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2023057287|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:24:16,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2030951487 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2030951487 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2030951487 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-2030951487 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-2030951487| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-2030951487| ~y$w_buff1_used~0_In-2030951487) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2030951487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2030951487, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2030951487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2030951487} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2030951487|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2030951487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2030951487, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2030951487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2030951487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:24:16,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-91235032 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-91235032 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-91235032| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-91235032| ~y$r_buff0_thd0~0_In-91235032) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-91235032, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-91235032} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-91235032|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-91235032, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-91235032} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:24:16,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-98848565 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-98848565 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-98848565 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-98848565 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-98848565|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-98848565 |ULTIMATE.start_main_#t~ite62_Out-98848565|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-98848565, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-98848565, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-98848565, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-98848565} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-98848565|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-98848565, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-98848565, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-98848565, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-98848565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:24:16,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:24:16,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:24:16 BasicIcfg [2019-11-28 18:24:16,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:24:16,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:24:16,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:24:16,717 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:24:16,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:50" (3/4) ... [2019-11-28 18:24:16,720 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:24:16,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1735~0.base_28| 4)) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1735~0.base_28| 1)) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1735~0.base_28|) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= |v_ULTIMATE.start_main_~#t1735~0.offset_20| 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1735~0.base_28|)) (= v_~y$w_buff1~0_192 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1735~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1735~0.base_28|) |v_ULTIMATE.start_main_~#t1735~0.offset_20| 0)) |v_#memory_int_13|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1735~0.base=|v_ULTIMATE.start_main_~#t1735~0.base_28|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_~#t1736~0.base=|v_ULTIMATE.start_main_~#t1736~0.base_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_~#t1735~0.offset=|v_ULTIMATE.start_main_~#t1735~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ULTIMATE.start_main_~#t1736~0.offset=|v_ULTIMATE.start_main_~#t1736~0.offset_14|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1735~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1736~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1735~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1736~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:16,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1736~0.base_13|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1736~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1736~0.base_13| 0)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1736~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1736~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1736~0.base_13|) |v_ULTIMATE.start_main_~#t1736~0.offset_11| 1))) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1736~0.base_13| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1736~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1736~0.base=|v_ULTIMATE.start_main_~#t1736~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1736~0.offset=|v_ULTIMATE.start_main_~#t1736~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1736~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1736~0.offset] because there is no mapped edge [2019-11-28 18:24:16,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:16,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1447142565 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1447142565 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In-1447142565 |P1Thread1of1ForFork1_#t~ite28_Out-1447142565|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1447142565| ~y$w_buff1~0_In-1447142565)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1447142565, ~y$w_buff1~0=~y$w_buff1~0_In-1447142565, ~y$w_buff0~0=~y$w_buff0~0_In-1447142565, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1447142565} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1447142565, ~y$w_buff1~0=~y$w_buff1~0_In-1447142565, ~y$w_buff0~0=~y$w_buff0~0_In-1447142565, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1447142565, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1447142565|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:24:16,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:24:16,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-11-28 18:24:16,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1312315258 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out1312315258| ~y~0_In1312315258) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out1312315258| ~y$mem_tmp~0_In1312315258)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1312315258, ~y$flush_delayed~0=~y$flush_delayed~0_In1312315258, ~y~0=~y~0_In1312315258} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1312315258, ~y$flush_delayed~0=~y$flush_delayed~0_In1312315258, ~y~0=~y~0_In1312315258, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1312315258|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-11-28 18:24:16,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-118865275 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-118865275 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-118865275| ~y$w_buff0_used~0_In-118865275)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-118865275| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-118865275, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118865275} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-118865275, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-118865275|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118865275} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-11-28 18:24:16,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-120250863 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-120250863 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-120250863 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-120250863 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out-120250863| ~y$w_buff1_used~0_In-120250863) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite52_Out-120250863| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-120250863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-120250863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-120250863, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-120250863} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-120250863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-120250863, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-120250863|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-120250863, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-120250863} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-11-28 18:24:16,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-343384870 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In-343384870 ~y$r_buff0_thd2~0_Out-343384870)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-343384870 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-343384870 0) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-343384870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-343384870} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-343384870|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-343384870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-343384870} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:24:16,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1811144977 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1811144977 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1811144977 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1811144977 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite54_Out-1811144977| ~y$r_buff1_thd2~0_In-1811144977) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-1811144977| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1811144977, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811144977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1811144977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1811144977} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1811144977, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811144977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1811144977, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1811144977|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1811144977} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 18:24:16,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:24:16,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1898089960 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-1898089960| ~y$mem_tmp~0_In-1898089960)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out-1898089960| ~y~0_In-1898089960) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1898089960, ~y$flush_delayed~0=~y$flush_delayed~0_In-1898089960, ~y~0=~y~0_In-1898089960} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1898089960, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1898089960|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1898089960, ~y~0=~y~0_In-1898089960} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-11-28 18:24:16,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:24:16,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:24:16,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1932374414 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1932374414 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In1932374414 |ULTIMATE.start_main_#t~ite57_Out1932374414|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In1932374414 |ULTIMATE.start_main_#t~ite57_Out1932374414|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1932374414, ~y~0=~y~0_In1932374414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1932374414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932374414} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1932374414, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1932374414|, ~y~0=~y~0_In1932374414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1932374414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1932374414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-11-28 18:24:16,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-11-28 18:24:16,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2023057287 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2023057287 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out2023057287|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out2023057287| ~y$w_buff0_used~0_In2023057287)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2023057287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2023057287} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2023057287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2023057287, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2023057287|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:24:16,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2030951487 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2030951487 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2030951487 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-2030951487 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-2030951487| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-2030951487| ~y$w_buff1_used~0_In-2030951487) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2030951487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2030951487, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2030951487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2030951487} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2030951487|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2030951487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2030951487, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2030951487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2030951487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:24:16,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-91235032 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-91235032 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-91235032| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-91235032| ~y$r_buff0_thd0~0_In-91235032) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-91235032, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-91235032} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-91235032|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-91235032, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-91235032} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:24:16,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-98848565 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-98848565 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-98848565 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-98848565 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-98848565|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-98848565 |ULTIMATE.start_main_#t~ite62_Out-98848565|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-98848565, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-98848565, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-98848565, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-98848565} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-98848565|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-98848565, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-98848565, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-98848565, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-98848565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:24:16,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:24:16,893 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:24:16,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:24:16,895 INFO L168 Benchmark]: Toolchain (without parser) took 28037.81 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 956.3 MB in the beginning and 838.9 MB in the end (delta: 117.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-28 18:24:16,897 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:24:16,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:16,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.46 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:16,899 INFO L168 Benchmark]: Boogie Preprocessor took 50.77 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:24:16,899 INFO L168 Benchmark]: RCFGBuilder took 1004.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:16,900 INFO L168 Benchmark]: TraceAbstraction took 25954.85 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 838.9 MB in the end (delta: 187.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-28 18:24:16,900 INFO L168 Benchmark]: Witness Printer took 177.68 ms. Allocated memory is still 2.5 GB. Free memory is still 838.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:24:16,902 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 770.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.46 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.77 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 1004.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25954.85 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 838.9 MB in the end (delta: 187.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 177.68 ms. Allocated memory is still 2.5 GB. Free memory is still 838.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1735, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1736, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3303 SDtfs, 3299 SDslu, 4771 SDs, 0 SdLazy, 2160 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60518occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 19100 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 626 ConstructedInterpolants, 0 QuantifiedInterpolants, 112561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...