./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/pthread-wmm/mix035_tso.opt_false-unreach-call.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 00d92b40773ef1575f2814e1b92f3f694886005e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-2e94e6a [2018-12-31 20:37:29,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:37:29,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:37:29,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:37:29,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:37:29,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:37:29,491 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:37:29,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:37:29,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:37:29,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:37:29,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:37:29,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:37:29,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:37:29,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:37:29,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:37:29,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:37:29,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:37:29,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:37:29,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:37:29,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:37:29,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:37:29,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:37:29,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:37:29,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:37:29,513 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:37:29,514 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:37:29,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:37:29,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:37:29,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:37:29,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:37:29,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:37:29,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:37:29,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:37:29,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:37:29,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:37:29,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:37:29,522 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 20:37:29,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:37:29,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:37:29,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:37:29,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:37:29,540 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:37:29,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:37:29,541 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:37:29,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:37:29,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:37:29,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:37:29,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:37:29,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:37:29,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:37:29,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:37:29,542 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:37:29,542 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:37:29,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:37:29,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:37:29,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:37:29,543 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:37:29,543 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:37:29,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:37:29,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:37:29,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:37:29,544 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:37:29,544 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:37:29,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:37:29,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:37:29,545 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 00d92b40773ef1575f2814e1b92f3f694886005e [2018-12-31 20:37:29,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:37:29,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:37:29,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:37:29,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:37:29,615 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:37:29,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i [2018-12-31 20:37:29,680 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00334dd34/8e814579bb68431d8c6609978ca8ecf7/FLAGdedb15908 [2018-12-31 20:37:30,181 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:37:30,182 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix035_tso.opt_false-unreach-call.i [2018-12-31 20:37:30,199 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00334dd34/8e814579bb68431d8c6609978ca8ecf7/FLAGdedb15908 [2018-12-31 20:37:30,487 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00334dd34/8e814579bb68431d8c6609978ca8ecf7 [2018-12-31 20:37:30,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:37:30,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:37:30,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:37:30,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:37:30,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:37:30,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:37:30" (1/1) ... [2018-12-31 20:37:30,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@306cbffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:30, skipping insertion in model container [2018-12-31 20:37:30,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:37:30" (1/1) ... [2018-12-31 20:37:30,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:37:30,585 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:37:31,123 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:37:31,147 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:37:31,374 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:37:31,492 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:37:31,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31 WrapperNode [2018-12-31 20:37:31,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:37:31,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:37:31,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:37:31,495 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:37:31,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:37:31,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:37:31,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:37:31,586 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:37:31,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (1/1) ... [2018-12-31 20:37:31,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:37:31,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:37:31,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:37:31,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:37:31,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (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 [2018-12-31 20:37:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:37:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:37:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:37:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:37:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:37:31,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:37:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:37:31,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:37:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-31 20:37:31,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-31 20:37:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:37:31,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:37:31,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:37:31,759 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 20:37:33,071 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:37:33,071 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:37:33,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:37:33 BoogieIcfgContainer [2018-12-31 20:37:33,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:37:33,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:37:33,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:37:33,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:37:33,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:37:30" (1/3) ... [2018-12-31 20:37:33,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a274ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:37:33, skipping insertion in model container [2018-12-31 20:37:33,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:37:31" (2/3) ... [2018-12-31 20:37:33,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a274ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:37:33, skipping insertion in model container [2018-12-31 20:37:33,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:37:33" (3/3) ... [2018-12-31 20:37:33,081 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_tso.opt_false-unreach-call.i [2018-12-31 20:37:33,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,133 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,133 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,135 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,136 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,136 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,136 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,136 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,136 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,136 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,137 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,137 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,137 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,137 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,137 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,138 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,141 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,154 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,154 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,154 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,154 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,155 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,156 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,157 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,158 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,159 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,160 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,160 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,160 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,160 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,161 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,162 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,163 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,165 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,165 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,166 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,166 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,166 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,167 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,168 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,168 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,170 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,170 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,171 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,171 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,171 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,172 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,173 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,174 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,175 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,181 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:37:33,229 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:37:33,229 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:37:33,239 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:37:33,259 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:37:33,286 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:37:33,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:37:33,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:37:33,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:37:33,287 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:37:33,287 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:37:33,287 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:37:33,287 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:37:33,289 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:37:33,304 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147places, 178 transitions [2018-12-31 20:38:07,792 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149046 states. [2018-12-31 20:38:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 149046 states. [2018-12-31 20:38:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 20:38:07,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:07,814 INFO L402 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] [2018-12-31 20:38:07,817 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:07,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:07,822 INFO L82 PathProgramCache]: Analyzing trace with hash 585073781, now seen corresponding path program 1 times [2018-12-31 20:38:07,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:07,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:07,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:08,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:08,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:38:08,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:38:08,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:38:08,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:38:08,223 INFO L87 Difference]: Start difference. First operand 149046 states. Second operand 4 states. [2018-12-31 20:38:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:16,637 INFO L93 Difference]: Finished difference Result 257066 states and 1188605 transitions. [2018-12-31 20:38:16,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:38:16,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-31 20:38:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:17,979 INFO L225 Difference]: With dead ends: 257066 [2018-12-31 20:38:17,980 INFO L226 Difference]: Without dead ends: 174816 [2018-12-31 20:38:17,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:38:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174816 states. [2018-12-31 20:38:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174816 to 110556. [2018-12-31 20:38:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110556 states. [2018-12-31 20:38:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110556 states to 110556 states and 511487 transitions. [2018-12-31 20:38:24,635 INFO L78 Accepts]: Start accepts. Automaton has 110556 states and 511487 transitions. Word has length 47 [2018-12-31 20:38:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:24,637 INFO L480 AbstractCegarLoop]: Abstraction has 110556 states and 511487 transitions. [2018-12-31 20:38:24,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:38:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 110556 states and 511487 transitions. [2018-12-31 20:38:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 20:38:24,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:24,661 INFO L402 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] [2018-12-31 20:38:24,662 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 188144804, now seen corresponding path program 1 times [2018-12-31 20:38:24,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:24,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:24,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:24,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:24,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:24,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:24,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:38:24,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:38:24,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:38:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:38:24,814 INFO L87 Difference]: Start difference. First operand 110556 states and 511487 transitions. Second operand 3 states. [2018-12-31 20:38:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:25,860 INFO L93 Difference]: Finished difference Result 110556 states and 510462 transitions. [2018-12-31 20:38:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:38:25,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-31 20:38:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:26,447 INFO L225 Difference]: With dead ends: 110556 [2018-12-31 20:38:26,447 INFO L226 Difference]: Without dead ends: 110556 [2018-12-31 20:38:26,449 INFO L631 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 [2018-12-31 20:38:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110556 states. [2018-12-31 20:38:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110556 to 110556. [2018-12-31 20:38:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110556 states. [2018-12-31 20:38:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110556 states to 110556 states and 510462 transitions. [2018-12-31 20:38:31,767 INFO L78 Accepts]: Start accepts. Automaton has 110556 states and 510462 transitions. Word has length 55 [2018-12-31 20:38:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:31,768 INFO L480 AbstractCegarLoop]: Abstraction has 110556 states and 510462 transitions. [2018-12-31 20:38:31,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:38:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 110556 states and 510462 transitions. [2018-12-31 20:38:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 20:38:31,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:31,783 INFO L402 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] [2018-12-31 20:38:31,783 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:31,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:31,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1930955139, now seen corresponding path program 1 times [2018-12-31 20:38:31,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:31,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:31,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:31,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:31,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:31,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:31,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:38:31,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:38:31,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:38:31,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:38:31,942 INFO L87 Difference]: Start difference. First operand 110556 states and 510462 transitions. Second operand 4 states. [2018-12-31 20:38:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:32,731 INFO L93 Difference]: Finished difference Result 99454 states and 447847 transitions. [2018-12-31 20:38:32,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:38:32,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-31 20:38:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:33,191 INFO L225 Difference]: With dead ends: 99454 [2018-12-31 20:38:33,192 INFO L226 Difference]: Without dead ends: 95224 [2018-12-31 20:38:33,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:38:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95224 states. [2018-12-31 20:38:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95224 to 95224. [2018-12-31 20:38:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95224 states. [2018-12-31 20:38:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95224 states to 95224 states and 432231 transitions. [2018-12-31 20:38:43,517 INFO L78 Accepts]: Start accepts. Automaton has 95224 states and 432231 transitions. Word has length 55 [2018-12-31 20:38:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:43,518 INFO L480 AbstractCegarLoop]: Abstraction has 95224 states and 432231 transitions. [2018-12-31 20:38:43,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:38:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 95224 states and 432231 transitions. [2018-12-31 20:38:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:38:43,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:43,530 INFO L402 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] [2018-12-31 20:38:43,530 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash -843007537, now seen corresponding path program 1 times [2018-12-31 20:38:43,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:43,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:43,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:43,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:43,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:43,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:38:43,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:38:43,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:38:43,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:38:43,840 INFO L87 Difference]: Start difference. First operand 95224 states and 432231 transitions. Second operand 5 states. [2018-12-31 20:38:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:44,196 INFO L93 Difference]: Finished difference Result 30968 states and 124075 transitions. [2018-12-31 20:38:44,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:38:44,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-31 20:38:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:44,294 INFO L225 Difference]: With dead ends: 30968 [2018-12-31 20:38:44,294 INFO L226 Difference]: Without dead ends: 27340 [2018-12-31 20:38:44,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:38:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27340 states. [2018-12-31 20:38:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27340 to 26880. [2018-12-31 20:38:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26880 states. [2018-12-31 20:38:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26880 states to 26880 states and 107557 transitions. [2018-12-31 20:38:44,955 INFO L78 Accepts]: Start accepts. Automaton has 26880 states and 107557 transitions. Word has length 56 [2018-12-31 20:38:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:44,956 INFO L480 AbstractCegarLoop]: Abstraction has 26880 states and 107557 transitions. [2018-12-31 20:38:44,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:38:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 26880 states and 107557 transitions. [2018-12-31 20:38:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:38:44,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:44,960 INFO L402 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] [2018-12-31 20:38:44,961 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:44,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:44,961 INFO L82 PathProgramCache]: Analyzing trace with hash -484759346, now seen corresponding path program 1 times [2018-12-31 20:38:44,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:44,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:44,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:44,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:44,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:45,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:45,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:38:45,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:38:45,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:38:45,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:38:45,213 INFO L87 Difference]: Start difference. First operand 26880 states and 107557 transitions. Second operand 6 states. [2018-12-31 20:38:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:46,570 INFO L93 Difference]: Finished difference Result 37432 states and 146030 transitions. [2018-12-31 20:38:46,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:38:46,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-31 20:38:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:46,676 INFO L225 Difference]: With dead ends: 37432 [2018-12-31 20:38:46,677 INFO L226 Difference]: Without dead ends: 37057 [2018-12-31 20:38:46,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:38:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37057 states. [2018-12-31 20:38:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37057 to 35273. [2018-12-31 20:38:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35273 states. [2018-12-31 20:38:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35273 states to 35273 states and 138604 transitions. [2018-12-31 20:38:47,544 INFO L78 Accepts]: Start accepts. Automaton has 35273 states and 138604 transitions. Word has length 56 [2018-12-31 20:38:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:47,544 INFO L480 AbstractCegarLoop]: Abstraction has 35273 states and 138604 transitions. [2018-12-31 20:38:47,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:38:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 35273 states and 138604 transitions. [2018-12-31 20:38:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-31 20:38:47,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:47,552 INFO L402 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] [2018-12-31 20:38:47,552 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1508119156, now seen corresponding path program 1 times [2018-12-31 20:38:47,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:47,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:47,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:47,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:47,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:38:47,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:38:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:38:47,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:38:47,660 INFO L87 Difference]: Start difference. First operand 35273 states and 138604 transitions. Second operand 3 states. [2018-12-31 20:38:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:48,063 INFO L93 Difference]: Finished difference Result 46813 states and 181800 transitions. [2018-12-31 20:38:48,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:38:48,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-31 20:38:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:48,230 INFO L225 Difference]: With dead ends: 46813 [2018-12-31 20:38:48,230 INFO L226 Difference]: Without dead ends: 46793 [2018-12-31 20:38:48,231 INFO L631 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 [2018-12-31 20:38:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46793 states. [2018-12-31 20:38:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46793 to 36255. [2018-12-31 20:38:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36255 states. [2018-12-31 20:38:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36255 states to 36255 states and 141311 transitions. [2018-12-31 20:38:49,078 INFO L78 Accepts]: Start accepts. Automaton has 36255 states and 141311 transitions. Word has length 58 [2018-12-31 20:38:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:49,079 INFO L480 AbstractCegarLoop]: Abstraction has 36255 states and 141311 transitions. [2018-12-31 20:38:49,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:38:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36255 states and 141311 transitions. [2018-12-31 20:38:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 20:38:49,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:49,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:38:49,087 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash 979024319, now seen corresponding path program 1 times [2018-12-31 20:38:49,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:49,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:49,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:49,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:49,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:49,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:38:49,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:38:49,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:38:49,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:38:49,211 INFO L87 Difference]: Start difference. First operand 36255 states and 141311 transitions. Second operand 6 states. [2018-12-31 20:38:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:51,170 INFO L93 Difference]: Finished difference Result 50347 states and 193733 transitions. [2018-12-31 20:38:51,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:38:51,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-31 20:38:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:51,330 INFO L225 Difference]: With dead ends: 50347 [2018-12-31 20:38:51,330 INFO L226 Difference]: Without dead ends: 49862 [2018-12-31 20:38:51,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 20:38:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49862 states. [2018-12-31 20:38:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49862 to 39289. [2018-12-31 20:38:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39289 states. [2018-12-31 20:38:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39289 states to 39289 states and 153196 transitions. [2018-12-31 20:38:52,236 INFO L78 Accepts]: Start accepts. Automaton has 39289 states and 153196 transitions. Word has length 62 [2018-12-31 20:38:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:52,237 INFO L480 AbstractCegarLoop]: Abstraction has 39289 states and 153196 transitions. [2018-12-31 20:38:52,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:38:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 39289 states and 153196 transitions. [2018-12-31 20:38:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 20:38:52,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:52,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:38:52,265 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash -307792068, now seen corresponding path program 1 times [2018-12-31 20:38:52,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:52,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:52,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:52,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:52,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:52,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:52,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:38:52,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:38:52,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:38:52,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:38:52,641 INFO L87 Difference]: Start difference. First operand 39289 states and 153196 transitions. Second operand 6 states. [2018-12-31 20:38:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:53,115 INFO L93 Difference]: Finished difference Result 12025 states and 40428 transitions. [2018-12-31 20:38:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:38:53,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-31 20:38:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:53,136 INFO L225 Difference]: With dead ends: 12025 [2018-12-31 20:38:53,137 INFO L226 Difference]: Without dead ends: 10201 [2018-12-31 20:38:53,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:38:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10201 states. [2018-12-31 20:38:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10201 to 10136. [2018-12-31 20:38:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10136 states. [2018-12-31 20:38:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10136 states to 10136 states and 33478 transitions. [2018-12-31 20:38:53,295 INFO L78 Accepts]: Start accepts. Automaton has 10136 states and 33478 transitions. Word has length 73 [2018-12-31 20:38:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:53,295 INFO L480 AbstractCegarLoop]: Abstraction has 10136 states and 33478 transitions. [2018-12-31 20:38:53,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:38:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 10136 states and 33478 transitions. [2018-12-31 20:38:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:38:53,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:53,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:38:53,315 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:53,315 INFO L82 PathProgramCache]: Analyzing trace with hash -677503587, now seen corresponding path program 1 times [2018-12-31 20:38:53,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:53,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:53,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:53,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:53,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:38:53,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:38:53,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:38:53,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:38:53,455 INFO L87 Difference]: Start difference. First operand 10136 states and 33478 transitions. Second operand 4 states. [2018-12-31 20:38:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:53,979 INFO L93 Difference]: Finished difference Result 16403 states and 52436 transitions. [2018-12-31 20:38:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:38:53,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 20:38:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:54,011 INFO L225 Difference]: With dead ends: 16403 [2018-12-31 20:38:54,011 INFO L226 Difference]: Without dead ends: 16403 [2018-12-31 20:38:54,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:38:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2018-12-31 20:38:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 11971. [2018-12-31 20:38:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11971 states. [2018-12-31 20:38:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11971 states to 11971 states and 38746 transitions. [2018-12-31 20:38:54,235 INFO L78 Accepts]: Start accepts. Automaton has 11971 states and 38746 transitions. Word has length 92 [2018-12-31 20:38:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:54,235 INFO L480 AbstractCegarLoop]: Abstraction has 11971 states and 38746 transitions. [2018-12-31 20:38:54,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:38:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 11971 states and 38746 transitions. [2018-12-31 20:38:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:38:54,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:54,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:38:54,260 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:54,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash -888854500, now seen corresponding path program 1 times [2018-12-31 20:38:54,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:54,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:54,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:54,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:54,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:54,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:38:54,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:38:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:38:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:38:54,393 INFO L87 Difference]: Start difference. First operand 11971 states and 38746 transitions. Second operand 4 states. [2018-12-31 20:38:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:54,819 INFO L93 Difference]: Finished difference Result 16269 states and 51830 transitions. [2018-12-31 20:38:54,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:38:54,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 20:38:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:54,847 INFO L225 Difference]: With dead ends: 16269 [2018-12-31 20:38:54,848 INFO L226 Difference]: Without dead ends: 16269 [2018-12-31 20:38:54,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:38:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16269 states. [2018-12-31 20:38:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16269 to 12406. [2018-12-31 20:38:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12406 states. [2018-12-31 20:38:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12406 states to 12406 states and 40224 transitions. [2018-12-31 20:38:55,060 INFO L78 Accepts]: Start accepts. Automaton has 12406 states and 40224 transitions. Word has length 92 [2018-12-31 20:38:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:55,060 INFO L480 AbstractCegarLoop]: Abstraction has 12406 states and 40224 transitions. [2018-12-31 20:38:55,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:38:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12406 states and 40224 transitions. [2018-12-31 20:38:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:38:55,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:55,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:38:55,083 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:55,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1328903453, now seen corresponding path program 1 times [2018-12-31 20:38:55,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:55,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:55,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:55,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:55,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:38:55,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:38:55,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:38:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:38:55,229 INFO L87 Difference]: Start difference. First operand 12406 states and 40224 transitions. Second operand 3 states. [2018-12-31 20:38:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:55,534 INFO L93 Difference]: Finished difference Result 13041 states and 42027 transitions. [2018-12-31 20:38:55,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:38:55,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-31 20:38:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:55,560 INFO L225 Difference]: With dead ends: 13041 [2018-12-31 20:38:55,560 INFO L226 Difference]: Without dead ends: 13041 [2018-12-31 20:38:55,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:38:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13041 states. [2018-12-31 20:38:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13041 to 12696. [2018-12-31 20:38:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12696 states. [2018-12-31 20:38:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12696 states to 12696 states and 40971 transitions. [2018-12-31 20:38:55,769 INFO L78 Accepts]: Start accepts. Automaton has 12696 states and 40971 transitions. Word has length 92 [2018-12-31 20:38:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:55,769 INFO L480 AbstractCegarLoop]: Abstraction has 12696 states and 40971 transitions. [2018-12-31 20:38:55,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:38:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 12696 states and 40971 transitions. [2018-12-31 20:38:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:38:55,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:55,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:38:55,791 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1042856709, now seen corresponding path program 2 times [2018-12-31 20:38:55,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:55,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:55,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:55,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:56,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:38:56,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:38:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:38:56,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:38:56,041 INFO L87 Difference]: Start difference. First operand 12696 states and 40971 transitions. Second operand 4 states. [2018-12-31 20:38:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:56,662 INFO L93 Difference]: Finished difference Result 13528 states and 43739 transitions. [2018-12-31 20:38:56,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:38:56,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 20:38:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:56,689 INFO L225 Difference]: With dead ends: 13528 [2018-12-31 20:38:56,690 INFO L226 Difference]: Without dead ends: 13528 [2018-12-31 20:38:56,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:38:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13528 states. [2018-12-31 20:38:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13528 to 12952. [2018-12-31 20:38:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12952 states. [2018-12-31 20:38:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12952 states to 12952 states and 41867 transitions. [2018-12-31 20:38:56,916 INFO L78 Accepts]: Start accepts. Automaton has 12952 states and 41867 transitions. Word has length 92 [2018-12-31 20:38:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:56,917 INFO L480 AbstractCegarLoop]: Abstraction has 12952 states and 41867 transitions. [2018-12-31 20:38:56,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:38:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 12952 states and 41867 transitions. [2018-12-31 20:38:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:38:56,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:56,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:38:56,938 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash -764597754, now seen corresponding path program 1 times [2018-12-31 20:38:56,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:56,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:38:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:57,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:57,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:38:57,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:38:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:38:57,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:38:57,208 INFO L87 Difference]: Start difference. First operand 12952 states and 41867 transitions. Second operand 6 states. [2018-12-31 20:38:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:38:57,751 INFO L93 Difference]: Finished difference Result 18685 states and 59837 transitions. [2018-12-31 20:38:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:38:57,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 20:38:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:38:57,787 INFO L225 Difference]: With dead ends: 18685 [2018-12-31 20:38:57,787 INFO L226 Difference]: Without dead ends: 18557 [2018-12-31 20:38:57,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:38:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18557 states. [2018-12-31 20:38:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18557 to 16485. [2018-12-31 20:38:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16485 states. [2018-12-31 20:38:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16485 states to 16485 states and 53213 transitions. [2018-12-31 20:38:58,075 INFO L78 Accepts]: Start accepts. Automaton has 16485 states and 53213 transitions. Word has length 92 [2018-12-31 20:38:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:38:58,076 INFO L480 AbstractCegarLoop]: Abstraction has 16485 states and 53213 transitions. [2018-12-31 20:38:58,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:38:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 16485 states and 53213 transitions. [2018-12-31 20:38:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:38:58,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:38:58,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:38:58,102 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:38:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:38:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1733418183, now seen corresponding path program 1 times [2018-12-31 20:38:58,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:38:58,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:38:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:58,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:38:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:38:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:38:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:38:58,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:38:58,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:38:58,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:38:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:38:58,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:38:58,760 INFO L87 Difference]: Start difference. First operand 16485 states and 53213 transitions. Second operand 7 states. [2018-12-31 20:39:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:00,406 INFO L93 Difference]: Finished difference Result 30090 states and 97304 transitions. [2018-12-31 20:39:00,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 20:39:00,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-31 20:39:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:00,466 INFO L225 Difference]: With dead ends: 30090 [2018-12-31 20:39:00,466 INFO L226 Difference]: Without dead ends: 30090 [2018-12-31 20:39:00,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-31 20:39:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30090 states. [2018-12-31 20:39:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30090 to 19441. [2018-12-31 20:39:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19441 states. [2018-12-31 20:39:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19441 states to 19441 states and 63058 transitions. [2018-12-31 20:39:01,401 INFO L78 Accepts]: Start accepts. Automaton has 19441 states and 63058 transitions. Word has length 92 [2018-12-31 20:39:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:01,402 INFO L480 AbstractCegarLoop]: Abstraction has 19441 states and 63058 transitions. [2018-12-31 20:39:01,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:39:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19441 states and 63058 transitions. [2018-12-31 20:39:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:39:01,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:01,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:01,442 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1674045432, now seen corresponding path program 1 times [2018-12-31 20:39:01,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:01,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:01,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:01,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:01,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:01,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:01,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:39:01,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:39:01,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:39:01,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:39:01,704 INFO L87 Difference]: Start difference. First operand 19441 states and 63058 transitions. Second operand 6 states. [2018-12-31 20:39:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:02,358 INFO L93 Difference]: Finished difference Result 22178 states and 71372 transitions. [2018-12-31 20:39:02,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:39:02,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 20:39:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:02,402 INFO L225 Difference]: With dead ends: 22178 [2018-12-31 20:39:02,402 INFO L226 Difference]: Without dead ends: 22178 [2018-12-31 20:39:02,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:39:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22178 states. [2018-12-31 20:39:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22178 to 17776. [2018-12-31 20:39:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17776 states. [2018-12-31 20:39:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17776 states to 17776 states and 56961 transitions. [2018-12-31 20:39:02,721 INFO L78 Accepts]: Start accepts. Automaton has 17776 states and 56961 transitions. Word has length 92 [2018-12-31 20:39:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:02,721 INFO L480 AbstractCegarLoop]: Abstraction has 17776 states and 56961 transitions. [2018-12-31 20:39:02,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:39:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17776 states and 56961 transitions. [2018-12-31 20:39:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:39:02,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:02,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:02,748 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1196331413, now seen corresponding path program 1 times [2018-12-31 20:39:02,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:02,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:02,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:03,228 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-12-31 20:39:03,470 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-12-31 20:39:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:03,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:03,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:39:03,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:39:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:39:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:39:03,480 INFO L87 Difference]: Start difference. First operand 17776 states and 56961 transitions. Second operand 6 states. [2018-12-31 20:39:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:03,656 INFO L93 Difference]: Finished difference Result 18923 states and 60686 transitions. [2018-12-31 20:39:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:39:03,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 20:39:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:03,692 INFO L225 Difference]: With dead ends: 18923 [2018-12-31 20:39:03,693 INFO L226 Difference]: Without dead ends: 18923 [2018-12-31 20:39:03,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:39:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18923 states. [2018-12-31 20:39:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18923 to 15766. [2018-12-31 20:39:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2018-12-31 20:39:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 50032 transitions. [2018-12-31 20:39:03,985 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 50032 transitions. Word has length 92 [2018-12-31 20:39:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:03,985 INFO L480 AbstractCegarLoop]: Abstraction has 15766 states and 50032 transitions. [2018-12-31 20:39:03,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:39:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 50032 transitions. [2018-12-31 20:39:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 20:39:04,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:04,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:04,008 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 173075913, now seen corresponding path program 1 times [2018-12-31 20:39:04,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:04,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:04,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:39:04,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:39:04,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:39:04,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:39:04,344 INFO L87 Difference]: Start difference. First operand 15766 states and 50032 transitions. Second operand 6 states. [2018-12-31 20:39:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:04,750 INFO L93 Difference]: Finished difference Result 14486 states and 45104 transitions. [2018-12-31 20:39:04,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:39:04,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 20:39:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:04,777 INFO L225 Difference]: With dead ends: 14486 [2018-12-31 20:39:04,777 INFO L226 Difference]: Without dead ends: 14486 [2018-12-31 20:39:04,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:39:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14486 states. [2018-12-31 20:39:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14486 to 10377. [2018-12-31 20:39:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10377 states. [2018-12-31 20:39:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 32407 transitions. [2018-12-31 20:39:04,971 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 32407 transitions. Word has length 92 [2018-12-31 20:39:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:04,971 INFO L480 AbstractCegarLoop]: Abstraction has 10377 states and 32407 transitions. [2018-12-31 20:39:04,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:39:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 32407 transitions. [2018-12-31 20:39:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 20:39:04,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:04,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:04,987 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1810111865, now seen corresponding path program 1 times [2018-12-31 20:39:04,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:04,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:05,371 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:39:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:05,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:05,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:39:05,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:39:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:39:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:39:05,433 INFO L87 Difference]: Start difference. First operand 10377 states and 32407 transitions. Second operand 6 states. [2018-12-31 20:39:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:05,732 INFO L93 Difference]: Finished difference Result 12872 states and 39513 transitions. [2018-12-31 20:39:05,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:39:05,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 20:39:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:05,756 INFO L225 Difference]: With dead ends: 12872 [2018-12-31 20:39:05,756 INFO L226 Difference]: Without dead ends: 12582 [2018-12-31 20:39:05,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:39:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12582 states. [2018-12-31 20:39:05,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12582 to 10822. [2018-12-31 20:39:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10822 states. [2018-12-31 20:39:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10822 states to 10822 states and 33383 transitions. [2018-12-31 20:39:05,937 INFO L78 Accepts]: Start accepts. Automaton has 10822 states and 33383 transitions. Word has length 94 [2018-12-31 20:39:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:05,938 INFO L480 AbstractCegarLoop]: Abstraction has 10822 states and 33383 transitions. [2018-12-31 20:39:05,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:39:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 10822 states and 33383 transitions. [2018-12-31 20:39:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 20:39:05,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:05,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:05,952 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash 407646088, now seen corresponding path program 1 times [2018-12-31 20:39:05,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:05,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:05,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:06,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:06,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:39:06,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:39:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:39:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:39:06,227 INFO L87 Difference]: Start difference. First operand 10822 states and 33383 transitions. Second operand 6 states. [2018-12-31 20:39:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:06,548 INFO L93 Difference]: Finished difference Result 11837 states and 36215 transitions. [2018-12-31 20:39:06,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:39:06,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 20:39:06,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:06,581 INFO L225 Difference]: With dead ends: 11837 [2018-12-31 20:39:06,581 INFO L226 Difference]: Without dead ends: 11837 [2018-12-31 20:39:06,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:39:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2018-12-31 20:39:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 10922. [2018-12-31 20:39:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10922 states. [2018-12-31 20:39:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10922 states to 10922 states and 33518 transitions. [2018-12-31 20:39:06,796 INFO L78 Accepts]: Start accepts. Automaton has 10922 states and 33518 transitions. Word has length 94 [2018-12-31 20:39:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:06,796 INFO L480 AbstractCegarLoop]: Abstraction has 10922 states and 33518 transitions. [2018-12-31 20:39:06,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:39:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 10922 states and 33518 transitions. [2018-12-31 20:39:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 20:39:06,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:06,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:06,812 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash 618997001, now seen corresponding path program 1 times [2018-12-31 20:39:06,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:06,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:06,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:06,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:06,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:07,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:07,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:39:07,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:39:07,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:39:07,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:39:07,013 INFO L87 Difference]: Start difference. First operand 10922 states and 33518 transitions. Second operand 5 states. [2018-12-31 20:39:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:07,098 INFO L93 Difference]: Finished difference Result 10922 states and 33454 transitions. [2018-12-31 20:39:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:39:07,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 20:39:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:07,118 INFO L225 Difference]: With dead ends: 10922 [2018-12-31 20:39:07,119 INFO L226 Difference]: Without dead ends: 10922 [2018-12-31 20:39:07,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:39:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10922 states. [2018-12-31 20:39:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10922 to 10922. [2018-12-31 20:39:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10922 states. [2018-12-31 20:39:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10922 states to 10922 states and 33454 transitions. [2018-12-31 20:39:07,282 INFO L78 Accepts]: Start accepts. Automaton has 10922 states and 33454 transitions. Word has length 94 [2018-12-31 20:39:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:07,283 INFO L480 AbstractCegarLoop]: Abstraction has 10922 states and 33454 transitions. [2018-12-31 20:39:07,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:39:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 10922 states and 33454 transitions. [2018-12-31 20:39:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 20:39:07,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:07,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:07,298 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:07,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1506500682, now seen corresponding path program 1 times [2018-12-31 20:39:07,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:07,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:07,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:07,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:07,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:39:07,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:39:07,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:39:07,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:39:07,622 INFO L87 Difference]: Start difference. First operand 10922 states and 33454 transitions. Second operand 11 states. [2018-12-31 20:39:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:07,992 INFO L93 Difference]: Finished difference Result 21182 states and 64133 transitions. [2018-12-31 20:39:07,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 20:39:07,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-31 20:39:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:08,012 INFO L225 Difference]: With dead ends: 21182 [2018-12-31 20:39:08,012 INFO L226 Difference]: Without dead ends: 10886 [2018-12-31 20:39:08,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-12-31 20:39:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2018-12-31 20:39:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 9334. [2018-12-31 20:39:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9334 states. [2018-12-31 20:39:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9334 states to 9334 states and 28286 transitions. [2018-12-31 20:39:08,159 INFO L78 Accepts]: Start accepts. Automaton has 9334 states and 28286 transitions. Word has length 94 [2018-12-31 20:39:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:08,160 INFO L480 AbstractCegarLoop]: Abstraction has 9334 states and 28286 transitions. [2018-12-31 20:39:08,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:39:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9334 states and 28286 transitions. [2018-12-31 20:39:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 20:39:08,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:08,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:08,172 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:08,173 INFO L82 PathProgramCache]: Analyzing trace with hash 482894876, now seen corresponding path program 2 times [2018-12-31 20:39:08,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:08,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:08,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:08,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:08,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:08,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:39:08,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:39:08,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:39:08,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:39:08,506 INFO L87 Difference]: Start difference. First operand 9334 states and 28286 transitions. Second operand 7 states. [2018-12-31 20:39:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:08,651 INFO L93 Difference]: Finished difference Result 15758 states and 47892 transitions. [2018-12-31 20:39:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:39:08,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 20:39:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:08,665 INFO L225 Difference]: With dead ends: 15758 [2018-12-31 20:39:08,665 INFO L226 Difference]: Without dead ends: 6679 [2018-12-31 20:39:08,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:39:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2018-12-31 20:39:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6679. [2018-12-31 20:39:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6679 states. [2018-12-31 20:39:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 20272 transitions. [2018-12-31 20:39:08,763 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 20272 transitions. Word has length 94 [2018-12-31 20:39:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:08,764 INFO L480 AbstractCegarLoop]: Abstraction has 6679 states and 20272 transitions. [2018-12-31 20:39:08,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:39:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 20272 transitions. [2018-12-31 20:39:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 20:39:08,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:08,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:08,774 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash 903467139, now seen corresponding path program 1 times [2018-12-31 20:39:08,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:08,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:08,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:08,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:39:08,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:09,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:09,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:39:09,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:39:09,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:39:09,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:39:09,011 INFO L87 Difference]: Start difference. First operand 6679 states and 20272 transitions. Second operand 7 states. [2018-12-31 20:39:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:09,409 INFO L93 Difference]: Finished difference Result 7301 states and 22144 transitions. [2018-12-31 20:39:09,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:39:09,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 20:39:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:09,423 INFO L225 Difference]: With dead ends: 7301 [2018-12-31 20:39:09,424 INFO L226 Difference]: Without dead ends: 7301 [2018-12-31 20:39:09,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:39:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7301 states. [2018-12-31 20:39:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7301 to 6445. [2018-12-31 20:39:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6445 states. [2018-12-31 20:39:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6445 states to 6445 states and 19606 transitions. [2018-12-31 20:39:09,529 INFO L78 Accepts]: Start accepts. Automaton has 6445 states and 19606 transitions. Word has length 94 [2018-12-31 20:39:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:09,529 INFO L480 AbstractCegarLoop]: Abstraction has 6445 states and 19606 transitions. [2018-12-31 20:39:09,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:39:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 6445 states and 19606 transitions. [2018-12-31 20:39:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 20:39:09,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:09,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:09,539 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:09,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:09,540 INFO L82 PathProgramCache]: Analyzing trace with hash 126060386, now seen corresponding path program 3 times [2018-12-31 20:39:09,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:09,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:09,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:09,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:39:09,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:39:09,832 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:39:09,984 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 20:39:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:39:10,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:39:10,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:39:10,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:39:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:39:10,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:39:10,244 INFO L87 Difference]: Start difference. First operand 6445 states and 19606 transitions. Second operand 11 states. [2018-12-31 20:39:10,367 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-31 20:39:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:39:11,437 INFO L93 Difference]: Finished difference Result 12513 states and 38185 transitions. [2018-12-31 20:39:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:39:11,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-31 20:39:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:39:11,451 INFO L225 Difference]: With dead ends: 12513 [2018-12-31 20:39:11,452 INFO L226 Difference]: Without dead ends: 7343 [2018-12-31 20:39:11,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 20:39:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2018-12-31 20:39:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 6567. [2018-12-31 20:39:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6567 states. [2018-12-31 20:39:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 19777 transitions. [2018-12-31 20:39:11,556 INFO L78 Accepts]: Start accepts. Automaton has 6567 states and 19777 transitions. Word has length 94 [2018-12-31 20:39:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:39:11,556 INFO L480 AbstractCegarLoop]: Abstraction has 6567 states and 19777 transitions. [2018-12-31 20:39:11,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:39:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6567 states and 19777 transitions. [2018-12-31 20:39:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 20:39:11,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:39:11,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:39:11,566 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:39:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:39:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash -123561824, now seen corresponding path program 4 times [2018-12-31 20:39:11,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:39:11,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:39:11,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:11,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:39:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:39:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:39:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:39:11,662 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:39:11,926 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:39:11,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:39:11 BasicIcfg [2018-12-31 20:39:11,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:39:11,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:39:11,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:39:11,929 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:39:11,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:37:33" (3/4) ... [2018-12-31 20:39:11,935 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:39:12,185 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:39:12,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:39:12,189 INFO L168 Benchmark]: Toolchain (without parser) took 101697.29 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 954.0 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-31 20:39:12,190 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:39:12,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 999.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 20:39:12,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.00 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 20:39:12,192 INFO L168 Benchmark]: Boogie Preprocessor took 83.31 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. [2018-12-31 20:39:12,192 INFO L168 Benchmark]: RCFGBuilder took 1403.53 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-31 20:39:12,193 INFO L168 Benchmark]: TraceAbstraction took 98854.57 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-31 20:39:12,193 INFO L168 Benchmark]: Witness Printer took 256.37 ms. Allocated memory is still 6.3 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2018-12-31 20:39:12,196 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 999.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.00 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.31 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 1403.53 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98854.57 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 256.37 ms. Allocated memory is still 6.3 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L694] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0] [L695] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0] [L696] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L697] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L698] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L699] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L700] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L701] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L702] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L703] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L704] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L706] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L798] -1 pthread_t t936; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L799] FCALL, FORK -1 pthread_create(&t936, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L800] -1 pthread_t t937; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L801] FCALL, FORK -1 pthread_create(&t937, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L802] -1 pthread_t t938; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L803] FCALL, FORK -1 pthread_create(&t938, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L755] 0 y$w_buff1 = y$w_buff0 [L756] 0 y$w_buff0 = 1 [L757] 0 y$w_buff1_used = y$w_buff0_used [L758] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L760] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L761] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L762] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L763] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L764] 0 y$r_buff0_thd3 = (_Bool)1 [L767] 0 z = 1 [L770] 0 __unbuffered_p2_EAX = z [L773] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L712] 1 a = 1 [L715] 1 __unbuffered_p0_EAX = x [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L727] 2 x = 1 [L730] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 2 y$flush_delayed = weak$$choice2 [L733] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L734] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!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)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L776] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!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)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L777] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [!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)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L734] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L735] 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)) [L736] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L736] 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] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L779] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L780] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L780] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L783] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L737] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L737] 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)) [L738] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L738] 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)) [L739] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L739] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L740] 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)) [L741] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L742] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L742] 2 y = y$flush_delayed ? y$mem_tmp : y [L743] 2 y$flush_delayed = (_Bool)0 [L748] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L805] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L809] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L809] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L810] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L811] -1 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 [L812] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L812] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L813] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L813] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L816] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 220 locations, 3 error locations. UNSAFE Result, 98.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 26.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6025 SDtfs, 7215 SDslu, 15969 SDs, 0 SdLazy, 3600 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149046occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 29.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 127144 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2042 NumberOfCodeBlocks, 2042 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1924 ConstructedInterpolants, 0 QuantifiedInterpolants, 409862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...