./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.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/mix012_rmo.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 9a0d08bfd8098766a5ad0a6222addfa7401e63dc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:35:36,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 18:35:36,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 18:35:36,659 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 18:35:36,660 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 18:35:36,661 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 18:35:36,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 18:35:36,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 18:35:36,667 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 18:35:36,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 18:35:36,669 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 18:35:36,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 18:35:36,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 18:35:36,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 18:35:36,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 18:35:36,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 18:35:36,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 18:35:36,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 18:35:36,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 18:35:36,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 18:35:36,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 18:35:36,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 18:35:36,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 18:35:36,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 18:35:36,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 18:35:36,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 18:35:36,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 18:35:36,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 18:35:36,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 18:35:36,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 18:35:36,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 18:35:36,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 18:35:36,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 18:35:36,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 18:35:36,698 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 18:35:36,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 18:35:36,699 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 18:35:36,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 18:35:36,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 18:35:36,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 18:35:36,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 18:35:36,718 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 18:35:36,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 18:35:36,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 18:35:36,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 18:35:36,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 18:35:36,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 18:35:36,720 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 18:35:36,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 18:35:36,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 18:35:36,720 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 18:35:36,720 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 18:35:36,721 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 18:35:36,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 18:35:36,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 18:35:36,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 18:35:36,721 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 18:35:36,723 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 18:35:36,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:35:36,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 18:35:36,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 18:35:36,724 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 18:35:36,724 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 18:35:36,724 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 18:35:36,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 18:35:36,725 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 -> 9a0d08bfd8098766a5ad0a6222addfa7401e63dc [2018-12-31 18:35:36,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 18:35:36,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 18:35:36,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 18:35:36,803 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 18:35:36,803 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 18:35:36,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.opt_false-unreach-call.i [2018-12-31 18:35:36,875 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03418122a/f198fa8a7bb243ffae5051caa47d9ea5/FLAGb072f7bd9 [2018-12-31 18:35:37,477 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 18:35:37,478 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.opt_false-unreach-call.i [2018-12-31 18:35:37,508 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03418122a/f198fa8a7bb243ffae5051caa47d9ea5/FLAGb072f7bd9 [2018-12-31 18:35:37,720 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03418122a/f198fa8a7bb243ffae5051caa47d9ea5 [2018-12-31 18:35:37,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 18:35:37,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 18:35:37,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 18:35:37,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 18:35:37,732 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 18:35:37,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:35:37" (1/1) ... [2018-12-31 18:35:37,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2998007b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:37, skipping insertion in model container [2018-12-31 18:35:37,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:35:37" (1/1) ... [2018-12-31 18:35:37,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 18:35:37,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 18:35:38,316 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:35:38,331 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 18:35:38,546 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:35:38,629 INFO L195 MainTranslator]: Completed translation [2018-12-31 18:35:38,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38 WrapperNode [2018-12-31 18:35:38,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 18:35:38,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 18:35:38,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 18:35:38,631 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 18:35:38,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 18:35:38,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 18:35:38,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 18:35:38,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 18:35:38,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (1/1) ... [2018-12-31 18:35:38,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 18:35:38,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 18:35:38,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 18:35:38,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 18:35:38,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (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 18:35:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 18:35:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 18:35:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 18:35:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 18:35:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 18:35:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 18:35:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 18:35:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 18:35:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 18:35:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 18:35:38,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 18:35:38,839 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 18:35:39,959 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 18:35:39,959 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 18:35:39,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:39 BoogieIcfgContainer [2018-12-31 18:35:39,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 18:35:39,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 18:35:39,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 18:35:39,966 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 18:35:39,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:35:37" (1/3) ... [2018-12-31 18:35:39,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed41e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:35:39, skipping insertion in model container [2018-12-31 18:35:39,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:35:38" (2/3) ... [2018-12-31 18:35:39,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed41e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:35:39, skipping insertion in model container [2018-12-31 18:35:39,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:39" (3/3) ... [2018-12-31 18:35:39,970 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt_false-unreach-call.i [2018-12-31 18:35:40,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,022 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,023 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,023 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,023 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,023 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,024 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,024 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,024 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,024 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,025 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,027 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,027 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,027 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,027 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,027 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,028 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,029 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,030 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,032 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,032 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,033 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,033 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,033 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,033 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,034 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,034 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,035 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,041 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,041 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,042 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,042 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,042 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,043 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,044 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,045 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,046 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,046 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,046 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,046 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,046 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,047 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,047 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,047 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,047 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,058 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,058 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,058 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,059 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,059 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,059 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:35:40,116 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 18:35:40,116 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 18:35:40,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 18:35:40,144 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 18:35:40,168 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 18:35:40,169 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 18:35:40,169 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 18:35:40,169 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 18:35:40,169 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 18:35:40,169 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 18:35:40,169 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 18:35:40,170 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 18:35:40,170 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 18:35:40,184 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 18:35:42,999 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-31 18:35:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-31 18:35:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 18:35:43,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:43,012 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] [2018-12-31 18:35:43,015 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-31 18:35:43,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:43,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:43,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:43,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:43,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:43,449 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 18:35:43,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:43,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:43,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:43,479 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-31 18:35:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:44,927 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-31 18:35:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:44,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-31 18:35:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:45,333 INFO L225 Difference]: With dead ends: 60791 [2018-12-31 18:35:45,333 INFO L226 Difference]: Without dead ends: 44271 [2018-12-31 18:35:45,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 18:35:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-31 18:35:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-31 18:35:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-31 18:35:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-31 18:35:47,215 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-31 18:35:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:47,216 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-31 18:35:47,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-31 18:35:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 18:35:47,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:47,227 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] [2018-12-31 18:35:47,227 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:47,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:47,229 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-31 18:35:47,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:47,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:47,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:47,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:47,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:47,434 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 18:35:47,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:47,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:47,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:47,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:47,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:47,438 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-31 18:35:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:49,381 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-31 18:35:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:49,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 18:35:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:50,411 INFO L225 Difference]: With dead ends: 64005 [2018-12-31 18:35:50,412 INFO L226 Difference]: Without dead ends: 63453 [2018-12-31 18:35:50,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-31 18:35:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-31 18:35:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-31 18:35:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-31 18:35:51,997 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-31 18:35:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:52,000 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-31 18:35:52,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-31 18:35:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 18:35:52,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:52,009 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 18:35:52,009 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-31 18:35:52,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:52,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:52,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:52,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:52,300 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 18:35:52,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:52,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:52,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:52,302 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-31 18:35:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:55,428 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-31 18:35:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:55,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 18:35:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:55,834 INFO L225 Difference]: With dead ends: 81367 [2018-12-31 18:35:55,835 INFO L226 Difference]: Without dead ends: 80855 [2018-12-31 18:35:55,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-31 18:35:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-31 18:35:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-31 18:35:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-31 18:35:58,238 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-31 18:35:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:58,239 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-31 18:35:58,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-31 18:35:58,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 18:35:58,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:58,249 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] [2018-12-31 18:35:58,250 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-31 18:35:58,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:58,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:58,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:58,363 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 18:35:58,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:58,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:58,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:58,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:58,365 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-31 18:35:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:58,736 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-31 18:35:58,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:58,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 18:35:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:58,954 INFO L225 Difference]: With dead ends: 65251 [2018-12-31 18:35:58,954 INFO L226 Difference]: Without dead ends: 65251 [2018-12-31 18:35:58,954 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 18:35:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-31 18:36:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-31 18:36:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-31 18:36:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-31 18:36:00,289 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-31 18:36:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:00,290 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-31 18:36:00,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:36:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-31 18:36:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:36:01,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:01,286 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] [2018-12-31 18:36:01,287 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:01,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-31 18:36:01,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:01,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:01,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:01,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:01,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:01,570 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 18:36:01,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:01,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:01,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:01,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:01,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:01,573 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-31 18:36:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:02,795 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-31 18:36:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:36:02,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 18:36:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:02,993 INFO L225 Difference]: With dead ends: 67511 [2018-12-31 18:36:02,993 INFO L226 Difference]: Without dead ends: 67511 [2018-12-31 18:36:02,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-31 18:36:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-31 18:36:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-31 18:36:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-31 18:36:04,369 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-31 18:36:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:04,370 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-31 18:36:04,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-31 18:36:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:36:04,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:04,384 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] [2018-12-31 18:36:04,384 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-31 18:36:04,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:04,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:04,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:04,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:04,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:04,535 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 18:36:04,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:04,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:04,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:04,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:04,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:04,536 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-31 18:36:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:06,591 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-31 18:36:06,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:36:06,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-31 18:36:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:06,807 INFO L225 Difference]: With dead ends: 88528 [2018-12-31 18:36:06,808 INFO L226 Difference]: Without dead ends: 88528 [2018-12-31 18:36:06,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:36:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-31 18:36:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-31 18:36:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-31 18:36:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-31 18:36:08,408 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-31 18:36:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:08,409 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-31 18:36:08,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-31 18:36:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:36:08,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:08,424 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] [2018-12-31 18:36:08,424 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:08,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-31 18:36:08,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:08,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:08,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:08,539 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 18:36:08,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:08,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:36:08,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:36:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:36:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:36:08,541 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-31 18:36:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:08,927 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-31 18:36:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:36:08,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-31 18:36:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:09,054 INFO L225 Difference]: With dead ends: 57182 [2018-12-31 18:36:09,054 INFO L226 Difference]: Without dead ends: 57182 [2018-12-31 18:36:09,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 18:36:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-31 18:36:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-31 18:36:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-31 18:36:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-31 18:36:10,742 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-31 18:36:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:10,742 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-31 18:36:10,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:36:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-31 18:36:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:36:10,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:10,752 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] [2018-12-31 18:36:10,752 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:10,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-31 18:36:10,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:10,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:10,883 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 18:36:10,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:10,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:10,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:10,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:10,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:10,884 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-31 18:36:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:12,030 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-31 18:36:12,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:36:12,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 18:36:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:12,289 INFO L225 Difference]: With dead ends: 97908 [2018-12-31 18:36:12,289 INFO L226 Difference]: Without dead ends: 97332 [2018-12-31 18:36:12,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:36:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-31 18:36:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-31 18:36:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-31 18:36:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-31 18:36:13,734 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-31 18:36:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:13,735 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-31 18:36:13,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-31 18:36:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 18:36:13,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:13,746 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] [2018-12-31 18:36:13,746 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-31 18:36:13,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:13,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:13,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:13,897 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 18:36:13,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:13,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:36:13,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:36:13,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:36:13,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:13,898 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 4 states. [2018-12-31 18:36:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:14,160 INFO L93 Difference]: Finished difference Result 12705 states and 39586 transitions. [2018-12-31 18:36:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:36:14,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-31 18:36:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:14,178 INFO L225 Difference]: With dead ends: 12705 [2018-12-31 18:36:14,178 INFO L226 Difference]: Without dead ends: 10887 [2018-12-31 18:36:14,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-31 18:36:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-31 18:36:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-31 18:36:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33402 transitions. [2018-12-31 18:36:14,719 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33402 transitions. Word has length 54 [2018-12-31 18:36:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:14,719 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33402 transitions. [2018-12-31 18:36:14,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33402 transitions. [2018-12-31 18:36:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 18:36:14,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:14,724 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] [2018-12-31 18:36:14,724 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:14,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-31 18:36:14,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:14,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:14,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:14,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:14,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:14,910 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 18:36:14,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:14,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:36:14,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:36:14,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:36:14,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:14,912 INFO L87 Difference]: Start difference. First operand 10839 states and 33402 transitions. Second operand 4 states. [2018-12-31 18:36:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:15,069 INFO L93 Difference]: Finished difference Result 12386 states and 38231 transitions. [2018-12-31 18:36:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:36:15,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-31 18:36:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:15,092 INFO L225 Difference]: With dead ends: 12386 [2018-12-31 18:36:15,092 INFO L226 Difference]: Without dead ends: 12386 [2018-12-31 18:36:15,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 18:36:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-31 18:36:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-31 18:36:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-31 18:36:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 35015 transitions. [2018-12-31 18:36:15,273 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 35015 transitions. Word has length 61 [2018-12-31 18:36:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:15,274 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 35015 transitions. [2018-12-31 18:36:15,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 35015 transitions. [2018-12-31 18:36:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 18:36:15,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:15,278 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] [2018-12-31 18:36:15,278 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:15,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-31 18:36:15,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:15,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:15,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:15,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:15,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:15,440 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 18:36:15,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:15,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:15,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:15,443 INFO L87 Difference]: Start difference. First operand 11359 states and 35015 transitions. Second operand 6 states. [2018-12-31 18:36:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:16,034 INFO L93 Difference]: Finished difference Result 20935 states and 64448 transitions. [2018-12-31 18:36:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:36:16,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-31 18:36:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:16,070 INFO L225 Difference]: With dead ends: 20935 [2018-12-31 18:36:16,070 INFO L226 Difference]: Without dead ends: 20864 [2018-12-31 18:36:16,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:36:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-31 18:36:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-31 18:36:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-31 18:36:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40712 transitions. [2018-12-31 18:36:16,316 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40712 transitions. Word has length 61 [2018-12-31 18:36:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:16,317 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40712 transitions. [2018-12-31 18:36:16,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40712 transitions. [2018-12-31 18:36:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:16,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:16,323 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] [2018-12-31 18:36:16,324 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-31 18:36:16,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:16,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:16,442 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 18:36:16,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:16,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:36:16,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:36:16,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:36:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:36:16,443 INFO L87 Difference]: Start difference. First operand 13298 states and 40712 transitions. Second operand 3 states. [2018-12-31 18:36:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:17,058 INFO L93 Difference]: Finished difference Result 13930 states and 42364 transitions. [2018-12-31 18:36:17,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:36:17,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 18:36:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:17,079 INFO L225 Difference]: With dead ends: 13930 [2018-12-31 18:36:17,080 INFO L226 Difference]: Without dead ends: 13930 [2018-12-31 18:36:17,080 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 18:36:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-31 18:36:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-31 18:36:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-31 18:36:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41538 transitions. [2018-12-31 18:36:17,266 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41538 transitions. Word has length 67 [2018-12-31 18:36:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:17,266 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41538 transitions. [2018-12-31 18:36:17,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:36:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41538 transitions. [2018-12-31 18:36:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:17,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:17,273 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] [2018-12-31 18:36:17,273 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-31 18:36:17,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:17,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:17,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:17,440 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 18:36:17,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:17,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:36:17,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:36:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:36:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:17,441 INFO L87 Difference]: Start difference. First operand 13614 states and 41538 transitions. Second operand 4 states. [2018-12-31 18:36:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:17,750 INFO L93 Difference]: Finished difference Result 17463 states and 52743 transitions. [2018-12-31 18:36:17,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:36:17,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 18:36:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:17,779 INFO L225 Difference]: With dead ends: 17463 [2018-12-31 18:36:17,779 INFO L226 Difference]: Without dead ends: 17463 [2018-12-31 18:36:17,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 18:36:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-31 18:36:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-31 18:36:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-31 18:36:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46198 transitions. [2018-12-31 18:36:18,001 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46198 transitions. Word has length 67 [2018-12-31 18:36:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:18,001 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46198 transitions. [2018-12-31 18:36:18,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46198 transitions. [2018-12-31 18:36:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:18,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:18,010 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] [2018-12-31 18:36:18,010 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:18,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-31 18:36:18,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:18,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:18,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:18,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:18,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:18,184 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 18:36:18,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:18,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:18,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:18,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:18,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:18,185 INFO L87 Difference]: Start difference. First operand 15244 states and 46198 transitions. Second operand 6 states. [2018-12-31 18:36:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:19,188 INFO L93 Difference]: Finished difference Result 18862 states and 56126 transitions. [2018-12-31 18:36:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:19,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 18:36:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:19,228 INFO L225 Difference]: With dead ends: 18862 [2018-12-31 18:36:19,229 INFO L226 Difference]: Without dead ends: 18862 [2018-12-31 18:36:19,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-31 18:36:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-31 18:36:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-31 18:36:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53178 transitions. [2018-12-31 18:36:19,473 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53178 transitions. Word has length 67 [2018-12-31 18:36:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:19,474 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53178 transitions. [2018-12-31 18:36:19,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53178 transitions. [2018-12-31 18:36:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:19,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:19,484 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] [2018-12-31 18:36:19,484 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-31 18:36:19,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:19,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:19,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:19,712 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 18:36:19,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:19,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:19,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:19,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:19,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:19,713 INFO L87 Difference]: Start difference. First operand 17720 states and 53178 transitions. Second operand 6 states. [2018-12-31 18:36:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:20,214 INFO L93 Difference]: Finished difference Result 20389 states and 59240 transitions. [2018-12-31 18:36:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:36:20,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 18:36:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:20,247 INFO L225 Difference]: With dead ends: 20389 [2018-12-31 18:36:20,247 INFO L226 Difference]: Without dead ends: 20389 [2018-12-31 18:36:20,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:36:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-31 18:36:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-31 18:36:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-31 18:36:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53189 transitions. [2018-12-31 18:36:20,540 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53189 transitions. Word has length 67 [2018-12-31 18:36:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:20,540 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53189 transitions. [2018-12-31 18:36:20,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53189 transitions. [2018-12-31 18:36:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:20,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:36:20,552 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-31 18:36:20,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:20,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:20,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:20,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:20,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:20,709 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 18:36:20,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:20,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:20,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:20,711 INFO L87 Difference]: Start difference. First operand 18002 states and 53189 transitions. Second operand 5 states. [2018-12-31 18:36:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:21,176 INFO L93 Difference]: Finished difference Result 23413 states and 68682 transitions. [2018-12-31 18:36:21,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:21,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:36:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:21,216 INFO L225 Difference]: With dead ends: 23413 [2018-12-31 18:36:21,216 INFO L226 Difference]: Without dead ends: 23413 [2018-12-31 18:36:21,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-31 18:36:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-31 18:36:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-31 18:36:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62593 transitions. [2018-12-31 18:36:21,554 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62593 transitions. Word has length 67 [2018-12-31 18:36:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:21,555 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62593 transitions. [2018-12-31 18:36:21,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62593 transitions. [2018-12-31 18:36:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:21,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:21,567 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] [2018-12-31 18:36:21,567 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-31 18:36:21,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:21,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:21,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:21,774 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 18:36:21,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:21,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:36:21,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:36:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:36:21,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:21,775 INFO L87 Difference]: Start difference. First operand 21350 states and 62593 transitions. Second operand 4 states. [2018-12-31 18:36:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:22,374 INFO L93 Difference]: Finished difference Result 26758 states and 78553 transitions. [2018-12-31 18:36:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:36:22,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 18:36:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:22,420 INFO L225 Difference]: With dead ends: 26758 [2018-12-31 18:36:22,420 INFO L226 Difference]: Without dead ends: 26462 [2018-12-31 18:36:22,420 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 18:36:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26462 states. [2018-12-31 18:36:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26462 to 25142. [2018-12-31 18:36:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25142 states. [2018-12-31 18:36:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 73709 transitions. [2018-12-31 18:36:22,884 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 73709 transitions. Word has length 67 [2018-12-31 18:36:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:22,885 INFO L480 AbstractCegarLoop]: Abstraction has 25142 states and 73709 transitions. [2018-12-31 18:36:22,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 73709 transitions. [2018-12-31 18:36:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:22,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:22,896 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] [2018-12-31 18:36:22,896 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-31 18:36:22,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:22,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:22,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:22,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:22,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:23,124 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 18:36:23,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:23,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:23,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:23,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:23,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:23,127 INFO L87 Difference]: Start difference. First operand 25142 states and 73709 transitions. Second operand 5 states. [2018-12-31 18:36:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:23,634 INFO L93 Difference]: Finished difference Result 7314 states and 17674 transitions. [2018-12-31 18:36:23,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:36:23,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:36:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:23,646 INFO L225 Difference]: With dead ends: 7314 [2018-12-31 18:36:23,646 INFO L226 Difference]: Without dead ends: 6004 [2018-12-31 18:36:23,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-12-31 18:36:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5514. [2018-12-31 18:36:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2018-12-31 18:36:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 12848 transitions. [2018-12-31 18:36:23,722 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 12848 transitions. Word has length 67 [2018-12-31 18:36:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:23,722 INFO L480 AbstractCegarLoop]: Abstraction has 5514 states and 12848 transitions. [2018-12-31 18:36:23,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 12848 transitions. [2018-12-31 18:36:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:36:23,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:23,728 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] [2018-12-31 18:36:23,729 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:23,729 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-31 18:36:23,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:23,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:23,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:23,804 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 18:36:23,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:23,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:36:23,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:36:23,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:36:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:36:23,805 INFO L87 Difference]: Start difference. First operand 5514 states and 12848 transitions. Second operand 3 states. [2018-12-31 18:36:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:24,049 INFO L93 Difference]: Finished difference Result 7126 states and 16417 transitions. [2018-12-31 18:36:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:36:24,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 18:36:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:24,061 INFO L225 Difference]: With dead ends: 7126 [2018-12-31 18:36:24,061 INFO L226 Difference]: Without dead ends: 7126 [2018-12-31 18:36:24,062 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 18:36:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2018-12-31 18:36:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5453. [2018-12-31 18:36:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2018-12-31 18:36:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12388 transitions. [2018-12-31 18:36:24,145 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12388 transitions. Word has length 67 [2018-12-31 18:36:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:24,145 INFO L480 AbstractCegarLoop]: Abstraction has 5453 states and 12388 transitions. [2018-12-31 18:36:24,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:36:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12388 transitions. [2018-12-31 18:36:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 18:36:24,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:24,153 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 18:36:24,153 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-31 18:36:24,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:24,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:24,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:24,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:24,283 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 18:36:24,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:24,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:24,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:24,284 INFO L87 Difference]: Start difference. First operand 5453 states and 12388 transitions. Second operand 5 states. [2018-12-31 18:36:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:24,485 INFO L93 Difference]: Finished difference Result 6617 states and 15012 transitions. [2018-12-31 18:36:24,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:36:24,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-31 18:36:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:24,496 INFO L225 Difference]: With dead ends: 6617 [2018-12-31 18:36:24,496 INFO L226 Difference]: Without dead ends: 6617 [2018-12-31 18:36:24,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:36:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-12-31 18:36:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 5897. [2018-12-31 18:36:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-31 18:36:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13392 transitions. [2018-12-31 18:36:24,589 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13392 transitions. Word has length 73 [2018-12-31 18:36:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:24,589 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13392 transitions. [2018-12-31 18:36:24,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13392 transitions. [2018-12-31 18:36:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 18:36:24,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:24,597 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 18:36:24,597 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-31 18:36:24,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:24,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:24,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:24,780 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 18:36:24,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:24,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:24,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:24,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:24,781 INFO L87 Difference]: Start difference. First operand 5897 states and 13392 transitions. Second operand 7 states. [2018-12-31 18:36:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:25,247 INFO L93 Difference]: Finished difference Result 7099 states and 15961 transitions. [2018-12-31 18:36:25,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:36:25,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-31 18:36:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:25,257 INFO L225 Difference]: With dead ends: 7099 [2018-12-31 18:36:25,257 INFO L226 Difference]: Without dead ends: 6980 [2018-12-31 18:36:25,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 18:36:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-31 18:36:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5994. [2018-12-31 18:36:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-31 18:36:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13485 transitions. [2018-12-31 18:36:25,323 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13485 transitions. Word has length 73 [2018-12-31 18:36:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:25,323 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13485 transitions. [2018-12-31 18:36:25,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13485 transitions. [2018-12-31 18:36:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:25,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:25,330 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 18:36:25,330 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2018-12-31 18:36:25,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:25,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:25,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:25,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:25,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:25,460 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 18:36:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:25,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:25,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:25,461 INFO L87 Difference]: Start difference. First operand 5994 states and 13485 transitions. Second operand 5 states. [2018-12-31 18:36:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:26,693 INFO L93 Difference]: Finished difference Result 5550 states and 12354 transitions. [2018-12-31 18:36:26,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:36:26,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:36:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:26,702 INFO L225 Difference]: With dead ends: 5550 [2018-12-31 18:36:26,702 INFO L226 Difference]: Without dead ends: 5550 [2018-12-31 18:36:26,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 18:36:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2018-12-31 18:36:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5153. [2018-12-31 18:36:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-12-31 18:36:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 11452 transitions. [2018-12-31 18:36:26,762 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 11452 transitions. Word has length 94 [2018-12-31 18:36:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:26,762 INFO L480 AbstractCegarLoop]: Abstraction has 5153 states and 11452 transitions. [2018-12-31 18:36:26,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 11452 transitions. [2018-12-31 18:36:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:36:26,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:26,769 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 18:36:26,769 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash -451364121, now seen corresponding path program 1 times [2018-12-31 18:36:26,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:26,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:26,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:26,984 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 18:36:26,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:26,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:36:26,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:36:26,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:36:26,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:36:26,986 INFO L87 Difference]: Start difference. First operand 5153 states and 11452 transitions. Second operand 4 states. [2018-12-31 18:36:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:27,173 INFO L93 Difference]: Finished difference Result 6337 states and 14007 transitions. [2018-12-31 18:36:27,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:36:27,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 18:36:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:27,181 INFO L225 Difference]: With dead ends: 6337 [2018-12-31 18:36:27,181 INFO L226 Difference]: Without dead ends: 6337 [2018-12-31 18:36:27,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 18:36:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2018-12-31 18:36:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5568. [2018-12-31 18:36:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2018-12-31 18:36:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 12373 transitions. [2018-12-31 18:36:27,249 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 12373 transitions. Word has length 94 [2018-12-31 18:36:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:27,250 INFO L480 AbstractCegarLoop]: Abstraction has 5568 states and 12373 transitions. [2018-12-31 18:36:27,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:36:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 12373 transitions. [2018-12-31 18:36:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:27,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:27,258 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, 1, 1] [2018-12-31 18:36:27,258 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:27,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:27,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1661573399, now seen corresponding path program 1 times [2018-12-31 18:36:27,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:27,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:27,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:27,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:27,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:27,455 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 18:36:27,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:27,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:36:27,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:36:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:36:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:36:27,456 INFO L87 Difference]: Start difference. First operand 5568 states and 12373 transitions. Second operand 5 states. [2018-12-31 18:36:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:27,642 INFO L93 Difference]: Finished difference Result 6441 states and 14301 transitions. [2018-12-31 18:36:27,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:27,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 18:36:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:27,651 INFO L225 Difference]: With dead ends: 6441 [2018-12-31 18:36:27,651 INFO L226 Difference]: Without dead ends: 6441 [2018-12-31 18:36:27,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2018-12-31 18:36:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5079. [2018-12-31 18:36:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2018-12-31 18:36:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11282 transitions. [2018-12-31 18:36:27,711 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11282 transitions. Word has length 96 [2018-12-31 18:36:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:27,711 INFO L480 AbstractCegarLoop]: Abstraction has 5079 states and 11282 transitions. [2018-12-31 18:36:27,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:36:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11282 transitions. [2018-12-31 18:36:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:27,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:27,717 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, 1, 1] [2018-12-31 18:36:27,717 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:27,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:27,718 INFO L82 PathProgramCache]: Analyzing trace with hash -28769400, now seen corresponding path program 1 times [2018-12-31 18:36:27,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:27,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:27,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:27,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:27,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:28,126 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 18:36:28,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:28,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:28,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:28,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:28,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:28,127 INFO L87 Difference]: Start difference. First operand 5079 states and 11282 transitions. Second operand 7 states. [2018-12-31 18:36:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:28,558 INFO L93 Difference]: Finished difference Result 6777 states and 14905 transitions. [2018-12-31 18:36:28,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:36:28,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:36:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:28,568 INFO L225 Difference]: With dead ends: 6777 [2018-12-31 18:36:28,568 INFO L226 Difference]: Without dead ends: 6723 [2018-12-31 18:36:28,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:36:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6723 states. [2018-12-31 18:36:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6723 to 5556. [2018-12-31 18:36:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2018-12-31 18:36:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 12272 transitions. [2018-12-31 18:36:28,638 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 12272 transitions. Word has length 96 [2018-12-31 18:36:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:28,639 INFO L480 AbstractCegarLoop]: Abstraction has 5556 states and 12272 transitions. [2018-12-31 18:36:28,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 12272 transitions. [2018-12-31 18:36:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:28,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:28,646 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, 1, 1] [2018-12-31 18:36:28,646 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:28,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash -543358231, now seen corresponding path program 1 times [2018-12-31 18:36:28,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:28,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:28,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:28,992 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 18:36:28,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:28,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:28,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:28,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:28,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:28,994 INFO L87 Difference]: Start difference. First operand 5556 states and 12272 transitions. Second operand 6 states. [2018-12-31 18:36:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:29,390 INFO L93 Difference]: Finished difference Result 6493 states and 14426 transitions. [2018-12-31 18:36:29,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:36:29,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:36:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:29,401 INFO L225 Difference]: With dead ends: 6493 [2018-12-31 18:36:29,401 INFO L226 Difference]: Without dead ends: 6493 [2018-12-31 18:36:29,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:36:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2018-12-31 18:36:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 5763. [2018-12-31 18:36:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2018-12-31 18:36:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 12725 transitions. [2018-12-31 18:36:29,465 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 12725 transitions. Word has length 96 [2018-12-31 18:36:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:29,465 INFO L480 AbstractCegarLoop]: Abstraction has 5763 states and 12725 transitions. [2018-12-31 18:36:29,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 12725 transitions. [2018-12-31 18:36:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:29,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:29,472 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, 1, 1] [2018-12-31 18:36:29,473 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:29,473 INFO L82 PathProgramCache]: Analyzing trace with hash 400392135, now seen corresponding path program 1 times [2018-12-31 18:36:29,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:29,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:29,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:29,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:29,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:29,595 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 18:36:29,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:29,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:29,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:29,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:29,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:29,596 INFO L87 Difference]: Start difference. First operand 5763 states and 12725 transitions. Second operand 6 states. [2018-12-31 18:36:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:30,383 INFO L93 Difference]: Finished difference Result 7787 states and 17066 transitions. [2018-12-31 18:36:30,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:36:30,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:36:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:30,395 INFO L225 Difference]: With dead ends: 7787 [2018-12-31 18:36:30,396 INFO L226 Difference]: Without dead ends: 7771 [2018-12-31 18:36:30,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:36:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2018-12-31 18:36:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 6210. [2018-12-31 18:36:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2018-12-31 18:36:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 13818 transitions. [2018-12-31 18:36:30,479 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 13818 transitions. Word has length 96 [2018-12-31 18:36:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:30,480 INFO L480 AbstractCegarLoop]: Abstraction has 6210 states and 13818 transitions. [2018-12-31 18:36:30,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 13818 transitions. [2018-12-31 18:36:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:30,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:30,488 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, 1, 1] [2018-12-31 18:36:30,488 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:30,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:30,489 INFO L82 PathProgramCache]: Analyzing trace with hash 611743048, now seen corresponding path program 1 times [2018-12-31 18:36:30,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:30,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:30,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:30,707 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 18:36:30,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:30,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:36:30,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:36:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:36:30,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:36:30,708 INFO L87 Difference]: Start difference. First operand 6210 states and 13818 transitions. Second operand 6 states. [2018-12-31 18:36:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:30,931 INFO L93 Difference]: Finished difference Result 6536 states and 14293 transitions. [2018-12-31 18:36:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:30,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:36:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:30,942 INFO L225 Difference]: With dead ends: 6536 [2018-12-31 18:36:30,942 INFO L226 Difference]: Without dead ends: 6514 [2018-12-31 18:36:30,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2018-12-31 18:36:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 5548. [2018-12-31 18:36:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5548 states. [2018-12-31 18:36:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 12250 transitions. [2018-12-31 18:36:31,010 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 12250 transitions. Word has length 96 [2018-12-31 18:36:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:31,011 INFO L480 AbstractCegarLoop]: Abstraction has 5548 states and 12250 transitions. [2018-12-31 18:36:31,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:36:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 12250 transitions. [2018-12-31 18:36:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:31,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:31,017 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, 1, 1] [2018-12-31 18:36:31,018 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash -893987928, now seen corresponding path program 1 times [2018-12-31 18:36:31,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:31,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:31,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:31,417 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 18:36:31,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:31,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:36:31,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:36:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:36:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:36:31,419 INFO L87 Difference]: Start difference. First operand 5548 states and 12250 transitions. Second operand 9 states. [2018-12-31 18:36:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:32,134 INFO L93 Difference]: Finished difference Result 6597 states and 14375 transitions. [2018-12-31 18:36:32,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 18:36:32,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-31 18:36:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:32,145 INFO L225 Difference]: With dead ends: 6597 [2018-12-31 18:36:32,145 INFO L226 Difference]: Without dead ends: 6597 [2018-12-31 18:36:32,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:36:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2018-12-31 18:36:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 5852. [2018-12-31 18:36:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2018-12-31 18:36:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 12874 transitions. [2018-12-31 18:36:32,215 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 12874 transitions. Word has length 96 [2018-12-31 18:36:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:32,215 INFO L480 AbstractCegarLoop]: Abstraction has 5852 states and 12874 transitions. [2018-12-31 18:36:32,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:36:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 12874 transitions. [2018-12-31 18:36:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:32,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:32,222 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, 1, 1] [2018-12-31 18:36:32,223 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash 273485737, now seen corresponding path program 1 times [2018-12-31 18:36:32,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:32,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:32,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:32,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:32,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:32,362 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 18:36:32,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:32,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:32,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:32,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:32,364 INFO L87 Difference]: Start difference. First operand 5852 states and 12874 transitions. Second operand 7 states. [2018-12-31 18:36:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:32,813 INFO L93 Difference]: Finished difference Result 7331 states and 16051 transitions. [2018-12-31 18:36:32,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 18:36:32,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:36:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:32,823 INFO L225 Difference]: With dead ends: 7331 [2018-12-31 18:36:32,824 INFO L226 Difference]: Without dead ends: 7331 [2018-12-31 18:36:32,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:36:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2018-12-31 18:36:32,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 6796. [2018-12-31 18:36:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6796 states. [2018-12-31 18:36:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 14856 transitions. [2018-12-31 18:36:32,906 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 14856 transitions. Word has length 96 [2018-12-31 18:36:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:32,906 INFO L480 AbstractCegarLoop]: Abstraction has 6796 states and 14856 transitions. [2018-12-31 18:36:32,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 14856 transitions. [2018-12-31 18:36:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:32,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:32,915 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, 1, 1] [2018-12-31 18:36:32,915 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2033999799, now seen corresponding path program 1 times [2018-12-31 18:36:32,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:32,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:32,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:33,294 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 18:36:33,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:33,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:33,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:33,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:33,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:33,295 INFO L87 Difference]: Start difference. First operand 6796 states and 14856 transitions. Second operand 7 states. [2018-12-31 18:36:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:33,461 INFO L93 Difference]: Finished difference Result 8554 states and 18799 transitions. [2018-12-31 18:36:33,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:36:33,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:36:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:33,472 INFO L225 Difference]: With dead ends: 8554 [2018-12-31 18:36:33,472 INFO L226 Difference]: Without dead ends: 8554 [2018-12-31 18:36:33,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:36:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8554 states. [2018-12-31 18:36:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8554 to 6128. [2018-12-31 18:36:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6128 states. [2018-12-31 18:36:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6128 states to 6128 states and 13324 transitions. [2018-12-31 18:36:33,552 INFO L78 Accepts]: Start accepts. Automaton has 6128 states and 13324 transitions. Word has length 96 [2018-12-31 18:36:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:33,552 INFO L480 AbstractCegarLoop]: Abstraction has 6128 states and 13324 transitions. [2018-12-31 18:36:33,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6128 states and 13324 transitions. [2018-12-31 18:36:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:33,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:33,559 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, 1, 1] [2018-12-31 18:36:33,559 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1340898102, now seen corresponding path program 1 times [2018-12-31 18:36:33,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:33,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:33,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:33,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:33,775 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 18:36:33,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:33,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:36:33,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:36:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:36:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:36:33,776 INFO L87 Difference]: Start difference. First operand 6128 states and 13324 transitions. Second operand 7 states. [2018-12-31 18:36:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:34,037 INFO L93 Difference]: Finished difference Result 6757 states and 14643 transitions. [2018-12-31 18:36:34,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:36:34,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:36:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:34,046 INFO L225 Difference]: With dead ends: 6757 [2018-12-31 18:36:34,046 INFO L226 Difference]: Without dead ends: 6757 [2018-12-31 18:36:34,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:36:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2018-12-31 18:36:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 5214. [2018-12-31 18:36:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5214 states. [2018-12-31 18:36:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 11389 transitions. [2018-12-31 18:36:34,114 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 11389 transitions. Word has length 96 [2018-12-31 18:36:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:34,114 INFO L480 AbstractCegarLoop]: Abstraction has 5214 states and 11389 transitions. [2018-12-31 18:36:34,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:36:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 11389 transitions. [2018-12-31 18:36:34,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:34,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:34,121 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, 1, 1] [2018-12-31 18:36:34,121 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:34,121 INFO L82 PathProgramCache]: Analyzing trace with hash -453394421, now seen corresponding path program 1 times [2018-12-31 18:36:34,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:34,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:34,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:36:34,404 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 18:36:34,576 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 18:36:34,906 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 18:36:34,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:36:34,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 18:36:34,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 18:36:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 18:36:34,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:36:34,907 INFO L87 Difference]: Start difference. First operand 5214 states and 11389 transitions. Second operand 11 states. [2018-12-31 18:36:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:36:36,611 INFO L93 Difference]: Finished difference Result 9915 states and 21866 transitions. [2018-12-31 18:36:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 18:36:36,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-31 18:36:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:36:36,621 INFO L225 Difference]: With dead ends: 9915 [2018-12-31 18:36:36,621 INFO L226 Difference]: Without dead ends: 6171 [2018-12-31 18:36:36,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 18:36:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2018-12-31 18:36:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 4642. [2018-12-31 18:36:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2018-12-31 18:36:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 10103 transitions. [2018-12-31 18:36:36,682 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 10103 transitions. Word has length 96 [2018-12-31 18:36:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:36:36,683 INFO L480 AbstractCegarLoop]: Abstraction has 4642 states and 10103 transitions. [2018-12-31 18:36:36,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 18:36:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 10103 transitions. [2018-12-31 18:36:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:36:36,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:36:36,689 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, 1, 1] [2018-12-31 18:36:36,689 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:36:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:36:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-31 18:36:36,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:36:36,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:36:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:36,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:36:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:36:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:36:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:36:36,778 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 18:36:36,983 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 18:36:36,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:36:36 BasicIcfg [2018-12-31 18:36:36,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 18:36:36,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 18:36:36,989 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 18:36:36,989 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 18:36:36,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:35:39" (3/4) ... [2018-12-31 18:36:36,996 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 18:36:37,219 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 18:36:37,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 18:36:37,225 INFO L168 Benchmark]: Toolchain (without parser) took 59500.01 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -251.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-31 18:36:37,227 INFO L168 Benchmark]: CDTParser took 0.19 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 18:36:37,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 903.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 944.6 MB in the beginning and 1.0 GB in the end (delta: -101.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:37,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:37,228 INFO L168 Benchmark]: Boogie Preprocessor took 43.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:36:37,228 INFO L168 Benchmark]: RCFGBuilder took 1204.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:37,228 INFO L168 Benchmark]: TraceAbstraction took 57026.07 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 992.2 MB in the beginning and 1.3 GB in the end (delta: -262.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-31 18:36:37,236 INFO L168 Benchmark]: Witness Printer took 234.83 ms. Allocated memory is still 3.9 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2018-12-31 18:36:37,241 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.19 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 903.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 944.6 MB in the beginning and 1.0 GB in the end (delta: -101.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1204.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57026.07 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 992.2 MB in the beginning and 1.3 GB in the end (delta: -262.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 234.83 ms. Allocated memory is still 3.9 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t317; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t317, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 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_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t318; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t318, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 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) [L742] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 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)) [L743] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 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)) [L744] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 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)) [L745] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 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)) [L746] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 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)) [L747] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 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)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -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) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -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 [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -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 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 56.8s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 27.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8963 SDtfs, 10055 SDslu, 20213 SDs, 0 SdLazy, 8724 SolverSat, 461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 80 SyntacticMatches, 31 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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: 17.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 183550 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2361 ConstructedInterpolants, 0 QuantifiedInterpolants, 579333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...