./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_power.oepc_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/mix031_power.oepc_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 bce0588d4a12acd29c3d5522bdcbc4c6cb77e880 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 20:26:27,709 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:26:27,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:26:27,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:26:27,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:26:27,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:26:27,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:26:27,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:26:27,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:26:27,750 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:26:27,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:26:27,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:26:27,756 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:26:27,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:26:27,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:26:27,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:26:27,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:26:27,773 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:26:27,775 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:26:27,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:26:27,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:26:27,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:26:27,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:26:27,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:26:27,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:26:27,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:26:27,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:26:27,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:26:27,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:26:27,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:26:27,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:26:27,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:26:27,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:26:27,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:26:27,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:26:27,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:26:27,805 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 20:26:27,833 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:26:27,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:26:27,834 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:26:27,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:26:27,835 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:26:27,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:26:27,839 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:26:27,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:26:27,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:26:27,841 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:26:27,841 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:26:27,841 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:26:27,841 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:26:27,842 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:26:27,842 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:26:27,842 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:26:27,843 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:26:27,843 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:26:27,843 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:26:27,843 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:26:27,843 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:26:27,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:26:27,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:26:27,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:26:27,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:26:27,847 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:26:27,848 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:26:27,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:26:27,848 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 -> bce0588d4a12acd29c3d5522bdcbc4c6cb77e880 [2018-12-31 20:26:27,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:26:27,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:26:27,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:26:27,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:26:27,905 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:26:27,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_power.oepc_false-unreach-call.i [2018-12-31 20:26:27,978 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48f6c1ec/52afc48b06e641b6a9a0202a1cb0892d/FLAGb87d9fcaf [2018-12-31 20:26:28,598 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:26:28,599 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_power.oepc_false-unreach-call.i [2018-12-31 20:26:28,615 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48f6c1ec/52afc48b06e641b6a9a0202a1cb0892d/FLAGb87d9fcaf [2018-12-31 20:26:28,810 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48f6c1ec/52afc48b06e641b6a9a0202a1cb0892d [2018-12-31 20:26:28,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:26:28,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:26:28,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:26:28,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:26:28,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:26:28,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:26:28" (1/1) ... [2018-12-31 20:26:28,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d7f101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:28, skipping insertion in model container [2018-12-31 20:26:28,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:26:28" (1/1) ... [2018-12-31 20:26:28,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:26:28,901 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:26:29,361 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:26:29,380 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:26:29,582 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:26:29,667 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:26:29,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29 WrapperNode [2018-12-31 20:26:29,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:26:29,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:26:29,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:26:29,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:26:29,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:26:29,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:26:29,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:26:29,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:26:29,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... [2018-12-31 20:26:29,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:26:29,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:26:29,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:26:29,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:26:29,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:26:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:26:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:26:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:26:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:26:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:26:29,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:26:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:26:29,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:26:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:26:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:26:29,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:26:29,849 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 20:26:31,025 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:26:31,025 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:26:31,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:26:31 BoogieIcfgContainer [2018-12-31 20:26:31,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:26:31,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:26:31,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:26:31,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:26:31,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:26:28" (1/3) ... [2018-12-31 20:26:31,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f240933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:26:31, skipping insertion in model container [2018-12-31 20:26:31,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:26:29" (2/3) ... [2018-12-31 20:26:31,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f240933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:26:31, skipping insertion in model container [2018-12-31 20:26:31,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:26:31" (3/3) ... [2018-12-31 20:26:31,036 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc_false-unreach-call.i [2018-12-31 20:26:31,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,086 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,087 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,087 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,087 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,088 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,096 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,097 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,097 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,098 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,098 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,099 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,099 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,099 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,100 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,100 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,100 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,100 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,100 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,101 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,102 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,102 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,102 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,102 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,102 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,103 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,103 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,103 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,103 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,103 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,104 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,104 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,104 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,104 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,104 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,105 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,106 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,107 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,107 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,107 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,107 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,107 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,108 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,108 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,108 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,108 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,109 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,110 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,111 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,112 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,113 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,114 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,115 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,116 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,117 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,118 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,119 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,120 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,121 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:26:31,158 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:26:31,158 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:26:31,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:26:31,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:26:31,220 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:26:31,221 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:26:31,221 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:26:31,221 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:26:31,221 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:26:31,221 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:26:31,221 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:26:31,221 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:26:31,222 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:26:31,236 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2018-12-31 20:26:33,661 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2018-12-31 20:26:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2018-12-31 20:26:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 20:26:33,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:26:33,676 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] [2018-12-31 20:26:33,680 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:26:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:26:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2018-12-31 20:26:33,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:26:33,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:26:33,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:26:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:26:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:26:34,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:26:34,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:26:34,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:26:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:26:34,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:26:34,106 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2018-12-31 20:26:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:26:35,555 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2018-12-31 20:26:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:26:35,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-31 20:26:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:26:35,921 INFO L225 Difference]: With dead ends: 60794 [2018-12-31 20:26:35,922 INFO L226 Difference]: Without dead ends: 44274 [2018-12-31 20:26:35,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:26:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2018-12-31 20:26:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2018-12-31 20:26:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2018-12-31 20:26:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2018-12-31 20:26:37,870 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2018-12-31 20:26:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:26:37,873 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2018-12-31 20:26:37,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:26:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2018-12-31 20:26:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 20:26:37,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:26:37,892 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 20:26:37,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:26:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:26:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2018-12-31 20:26:37,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:26:37,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:26:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:37,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:26:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:26:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:26:38,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:26:38,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:26:38,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:26:38,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:26:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:26:38,061 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 5 states. [2018-12-31 20:26:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:26:41,352 INFO L93 Difference]: Finished difference Result 64008 states and 235338 transitions. [2018-12-31 20:26:41,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:26:41,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-31 20:26:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:26:41,719 INFO L225 Difference]: With dead ends: 64008 [2018-12-31 20:26:41,719 INFO L226 Difference]: Without dead ends: 63456 [2018-12-31 20:26:41,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:26:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63456 states. [2018-12-31 20:26:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63456 to 41424. [2018-12-31 20:26:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41424 states. [2018-12-31 20:26:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41424 states to 41424 states and 152333 transitions. [2018-12-31 20:26:43,873 INFO L78 Accepts]: Start accepts. Automaton has 41424 states and 152333 transitions. Word has length 49 [2018-12-31 20:26:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:26:43,875 INFO L480 AbstractCegarLoop]: Abstraction has 41424 states and 152333 transitions. [2018-12-31 20:26:43,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:26:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 41424 states and 152333 transitions. [2018-12-31 20:26:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 20:26:43,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:26:43,882 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] [2018-12-31 20:26:43,882 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:26:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:26:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2018-12-31 20:26:43,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:26:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:26:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:43,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:26:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:26:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:26:44,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:26:44,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:26:44,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:26:44,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:26:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:26:44,070 INFO L87 Difference]: Start difference. First operand 41424 states and 152333 transitions. Second operand 6 states. [2018-12-31 20:26:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:26:45,753 INFO L93 Difference]: Finished difference Result 52774 states and 191028 transitions. [2018-12-31 20:26:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:26:45,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-31 20:26:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:26:45,919 INFO L225 Difference]: With dead ends: 52774 [2018-12-31 20:26:45,919 INFO L226 Difference]: Without dead ends: 52262 [2018-12-31 20:26:45,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:26:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52262 states. [2018-12-31 20:26:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52262 to 45378. [2018-12-31 20:26:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45378 states. [2018-12-31 20:26:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45378 states to 45378 states and 166021 transitions. [2018-12-31 20:26:48,261 INFO L78 Accepts]: Start accepts. Automaton has 45378 states and 166021 transitions. Word has length 50 [2018-12-31 20:26:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:26:48,262 INFO L480 AbstractCegarLoop]: Abstraction has 45378 states and 166021 transitions. [2018-12-31 20:26:48,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:26:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 45378 states and 166021 transitions. [2018-12-31 20:26:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 20:26:48,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:26:48,271 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] [2018-12-31 20:26:48,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:26:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:26:48,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2018-12-31 20:26:48,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:26:48,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:26:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:26:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:26:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:26:48,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:26:48,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:26:48,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:26:48,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:26:48,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:26:48,366 INFO L87 Difference]: Start difference. First operand 45378 states and 166021 transitions. Second operand 3 states. [2018-12-31 20:26:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:26:48,688 INFO L93 Difference]: Finished difference Result 65254 states and 235817 transitions. [2018-12-31 20:26:48,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:26:48,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 20:26:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:26:48,886 INFO L225 Difference]: With dead ends: 65254 [2018-12-31 20:26:48,887 INFO L226 Difference]: Without dead ends: 65254 [2018-12-31 20:26:48,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:26:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65254 states. [2018-12-31 20:26:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65254 to 50948. [2018-12-31 20:26:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50948 states. [2018-12-31 20:26:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50948 states to 50948 states and 184328 transitions. [2018-12-31 20:26:50,120 INFO L78 Accepts]: Start accepts. Automaton has 50948 states and 184328 transitions. Word has length 52 [2018-12-31 20:26:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:26:50,120 INFO L480 AbstractCegarLoop]: Abstraction has 50948 states and 184328 transitions. [2018-12-31 20:26:50,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:26:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 50948 states and 184328 transitions. [2018-12-31 20:26:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:26:50,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:26:50,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:26:50,140 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:26:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:26:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -190326020, now seen corresponding path program 1 times [2018-12-31 20:26:50,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:26:50,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:26:50,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:50,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:26:50,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:26:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:26:50,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:26:50,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:26:50,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:26:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:26:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:26:50,548 INFO L87 Difference]: Start difference. First operand 50948 states and 184328 transitions. Second operand 6 states. [2018-12-31 20:26:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:26:55,009 INFO L93 Difference]: Finished difference Result 67514 states and 242188 transitions. [2018-12-31 20:26:55,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:26:55,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-31 20:26:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:26:55,196 INFO L225 Difference]: With dead ends: 67514 [2018-12-31 20:26:55,196 INFO L226 Difference]: Without dead ends: 67514 [2018-12-31 20:26:55,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:26:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67514 states. [2018-12-31 20:26:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67514 to 63439. [2018-12-31 20:26:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63439 states. [2018-12-31 20:26:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63439 states to 63439 states and 227587 transitions. [2018-12-31 20:26:56,505 INFO L78 Accepts]: Start accepts. Automaton has 63439 states and 227587 transitions. Word has length 56 [2018-12-31 20:26:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:26:56,506 INFO L480 AbstractCegarLoop]: Abstraction has 63439 states and 227587 transitions. [2018-12-31 20:26:56,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:26:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 63439 states and 227587 transitions. [2018-12-31 20:26:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:26:56,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:26:56,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:26:56,525 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:26:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:26:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1987277379, now seen corresponding path program 1 times [2018-12-31 20:26:56,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:26:56,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:26:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:56,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:26:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:26:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:26:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:26:56,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:26:56,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:26:56,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:26:56,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:26:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:26:56,765 INFO L87 Difference]: Start difference. First operand 63439 states and 227587 transitions. Second operand 7 states. [2018-12-31 20:26:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:26:59,244 INFO L93 Difference]: Finished difference Result 88531 states and 306204 transitions. [2018-12-31 20:26:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 20:26:59,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-12-31 20:26:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:26:59,472 INFO L225 Difference]: With dead ends: 88531 [2018-12-31 20:26:59,472 INFO L226 Difference]: Without dead ends: 88531 [2018-12-31 20:26:59,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:26:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88531 states. [2018-12-31 20:27:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88531 to 74884. [2018-12-31 20:27:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74884 states. [2018-12-31 20:27:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74884 states to 74884 states and 262990 transitions. [2018-12-31 20:27:01,076 INFO L78 Accepts]: Start accepts. Automaton has 74884 states and 262990 transitions. Word has length 56 [2018-12-31 20:27:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:01,076 INFO L480 AbstractCegarLoop]: Abstraction has 74884 states and 262990 transitions. [2018-12-31 20:27:01,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:27:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 74884 states and 262990 transitions. [2018-12-31 20:27:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:27:01,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:01,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:27:01,092 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1099773698, now seen corresponding path program 1 times [2018-12-31 20:27:01,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:01,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:01,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:01,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:01,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:01,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:27:01,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:27:01,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:27:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:27:01,253 INFO L87 Difference]: Start difference. First operand 74884 states and 262990 transitions. Second operand 4 states. [2018-12-31 20:27:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:01,461 INFO L93 Difference]: Finished difference Result 15378 states and 48829 transitions. [2018-12-31 20:27:01,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:27:01,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-31 20:27:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:01,486 INFO L225 Difference]: With dead ends: 15378 [2018-12-31 20:27:01,487 INFO L226 Difference]: Without dead ends: 13792 [2018-12-31 20:27:01,487 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 20:27:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13792 states. [2018-12-31 20:27:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13792 to 13743. [2018-12-31 20:27:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13743 states. [2018-12-31 20:27:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13743 states to 13743 states and 43355 transitions. [2018-12-31 20:27:01,694 INFO L78 Accepts]: Start accepts. Automaton has 13743 states and 43355 transitions. Word has length 56 [2018-12-31 20:27:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:01,694 INFO L480 AbstractCegarLoop]: Abstraction has 13743 states and 43355 transitions. [2018-12-31 20:27:01,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:27:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 13743 states and 43355 transitions. [2018-12-31 20:27:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 20:27:01,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:01,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:27:01,697 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:01,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2018-12-31 20:27:01,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:01,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:01,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:01,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:01,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:01,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:27:01,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:27:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:27:01,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:27:01,991 INFO L87 Difference]: Start difference. First operand 13743 states and 43355 transitions. Second operand 6 states. [2018-12-31 20:27:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:02,676 INFO L93 Difference]: Finished difference Result 19973 states and 62592 transitions. [2018-12-31 20:27:02,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:27:02,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-31 20:27:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:02,714 INFO L225 Difference]: With dead ends: 19973 [2018-12-31 20:27:02,714 INFO L226 Difference]: Without dead ends: 19901 [2018-12-31 20:27:02,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 20:27:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19901 states. [2018-12-31 20:27:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19901 to 14317. [2018-12-31 20:27:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14317 states. [2018-12-31 20:27:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14317 states to 14317 states and 45052 transitions. [2018-12-31 20:27:02,976 INFO L78 Accepts]: Start accepts. Automaton has 14317 states and 45052 transitions. Word has length 56 [2018-12-31 20:27:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:02,977 INFO L480 AbstractCegarLoop]: Abstraction has 14317 states and 45052 transitions. [2018-12-31 20:27:02,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:27:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 14317 states and 45052 transitions. [2018-12-31 20:27:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 20:27:02,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:02,982 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] [2018-12-31 20:27:02,982 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:02,983 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2018-12-31 20:27:02,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:02,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:02,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:03,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:03,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:27:03,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:27:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:27:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:27:03,199 INFO L87 Difference]: Start difference. First operand 14317 states and 45052 transitions. Second operand 4 states. [2018-12-31 20:27:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:03,411 INFO L93 Difference]: Finished difference Result 16620 states and 52380 transitions. [2018-12-31 20:27:03,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:27:03,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 20:27:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:03,453 INFO L225 Difference]: With dead ends: 16620 [2018-12-31 20:27:03,453 INFO L226 Difference]: Without dead ends: 16620 [2018-12-31 20:27:03,453 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 20:27:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16620 states. [2018-12-31 20:27:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16620 to 15137. [2018-12-31 20:27:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15137 states. [2018-12-31 20:27:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 47642 transitions. [2018-12-31 20:27:03,932 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 47642 transitions. Word has length 64 [2018-12-31 20:27:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:03,932 INFO L480 AbstractCegarLoop]: Abstraction has 15137 states and 47642 transitions. [2018-12-31 20:27:03,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:27:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 47642 transitions. [2018-12-31 20:27:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 20:27:03,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:03,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:27:03,939 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:03,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2018-12-31 20:27:03,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:03,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:03,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:03,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:04,213 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 20:27:04,530 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 7 [2018-12-31 20:27:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:04,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:04,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:27:04,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:27:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:27:04,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:04,588 INFO L87 Difference]: Start difference. First operand 15137 states and 47642 transitions. Second operand 8 states. [2018-12-31 20:27:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:05,448 INFO L93 Difference]: Finished difference Result 19827 states and 61331 transitions. [2018-12-31 20:27:05,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:27:05,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-12-31 20:27:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:05,486 INFO L225 Difference]: With dead ends: 19827 [2018-12-31 20:27:05,486 INFO L226 Difference]: Without dead ends: 19756 [2018-12-31 20:27:05,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-31 20:27:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19756 states. [2018-12-31 20:27:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19756 to 17415. [2018-12-31 20:27:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17415 states. [2018-12-31 20:27:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17415 states to 17415 states and 54316 transitions. [2018-12-31 20:27:05,763 INFO L78 Accepts]: Start accepts. Automaton has 17415 states and 54316 transitions. Word has length 64 [2018-12-31 20:27:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:05,763 INFO L480 AbstractCegarLoop]: Abstraction has 17415 states and 54316 transitions. [2018-12-31 20:27:05,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:27:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 17415 states and 54316 transitions. [2018-12-31 20:27:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:27:05,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:05,771 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] [2018-12-31 20:27:05,771 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:05,772 INFO L82 PathProgramCache]: Analyzing trace with hash -677873457, now seen corresponding path program 1 times [2018-12-31 20:27:05,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:05,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:05,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:05,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:05,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:05,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:27:05,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:27:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:27:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:27:05,891 INFO L87 Difference]: Start difference. First operand 17415 states and 54316 transitions. Second operand 4 states. [2018-12-31 20:27:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:06,615 INFO L93 Difference]: Finished difference Result 21359 states and 65805 transitions. [2018-12-31 20:27:06,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:27:06,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-31 20:27:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:06,655 INFO L225 Difference]: With dead ends: 21359 [2018-12-31 20:27:06,655 INFO L226 Difference]: Without dead ends: 21359 [2018-12-31 20:27:06,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:27:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2018-12-31 20:27:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 19309. [2018-12-31 20:27:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19309 states. [2018-12-31 20:27:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19309 states to 19309 states and 59695 transitions. [2018-12-31 20:27:06,982 INFO L78 Accepts]: Start accepts. Automaton has 19309 states and 59695 transitions. Word has length 68 [2018-12-31 20:27:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:06,982 INFO L480 AbstractCegarLoop]: Abstraction has 19309 states and 59695 transitions. [2018-12-31 20:27:06,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:27:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19309 states and 59695 transitions. [2018-12-31 20:27:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:27:06,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:06,993 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] [2018-12-31 20:27:06,993 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:06,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:06,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1539884496, now seen corresponding path program 1 times [2018-12-31 20:27:06,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:06,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:06,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:06,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:06,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:07,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:07,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:27:07,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:27:07,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:27:07,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:27:07,100 INFO L87 Difference]: Start difference. First operand 19309 states and 59695 transitions. Second operand 3 states. [2018-12-31 20:27:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:07,437 INFO L93 Difference]: Finished difference Result 19949 states and 61434 transitions. [2018-12-31 20:27:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:27:07,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-31 20:27:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:07,472 INFO L225 Difference]: With dead ends: 19949 [2018-12-31 20:27:07,472 INFO L226 Difference]: Without dead ends: 19949 [2018-12-31 20:27:07,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:27:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19949 states. [2018-12-31 20:27:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19949 to 19649. [2018-12-31 20:27:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19649 states. [2018-12-31 20:27:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19649 states to 19649 states and 60611 transitions. [2018-12-31 20:27:07,767 INFO L78 Accepts]: Start accepts. Automaton has 19649 states and 60611 transitions. Word has length 68 [2018-12-31 20:27:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:07,767 INFO L480 AbstractCegarLoop]: Abstraction has 19649 states and 60611 transitions. [2018-12-31 20:27:07,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:27:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 19649 states and 60611 transitions. [2018-12-31 20:27:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:27:07,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:07,779 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] [2018-12-31 20:27:07,779 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2018-12-31 20:27:07,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:07,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:07,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:07,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:07,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:07,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 20:27:07,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:07,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:27:07,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:27:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:27:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:27:07,907 INFO L87 Difference]: Start difference. First operand 19649 states and 60611 transitions. Second operand 6 states. [2018-12-31 20:27:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:09,100 INFO L93 Difference]: Finished difference Result 23817 states and 72329 transitions. [2018-12-31 20:27:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:27:09,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-31 20:27:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:09,148 INFO L225 Difference]: With dead ends: 23817 [2018-12-31 20:27:09,148 INFO L226 Difference]: Without dead ends: 23817 [2018-12-31 20:27:09,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:27:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23817 states. [2018-12-31 20:27:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23817 to 22477. [2018-12-31 20:27:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22477 states. [2018-12-31 20:27:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22477 states to 22477 states and 68751 transitions. [2018-12-31 20:27:09,522 INFO L78 Accepts]: Start accepts. Automaton has 22477 states and 68751 transitions. Word has length 70 [2018-12-31 20:27:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:09,522 INFO L480 AbstractCegarLoop]: Abstraction has 22477 states and 68751 transitions. [2018-12-31 20:27:09,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:27:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 22477 states and 68751 transitions. [2018-12-31 20:27:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:27:09,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:09,536 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] [2018-12-31 20:27:09,536 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2018-12-31 20:27:09,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:09,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:09,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:09,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:09,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:09,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:09,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:09,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:09,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:09,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:09,773 INFO L87 Difference]: Start difference. First operand 22477 states and 68751 transitions. Second operand 5 states. [2018-12-31 20:27:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:10,303 INFO L93 Difference]: Finished difference Result 29036 states and 88481 transitions. [2018-12-31 20:27:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:27:10,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:27:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:10,358 INFO L225 Difference]: With dead ends: 29036 [2018-12-31 20:27:10,358 INFO L226 Difference]: Without dead ends: 29036 [2018-12-31 20:27:10,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:27:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29036 states. [2018-12-31 20:27:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29036 to 26257. [2018-12-31 20:27:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26257 states. [2018-12-31 20:27:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26257 states to 26257 states and 79967 transitions. [2018-12-31 20:27:11,008 INFO L78 Accepts]: Start accepts. Automaton has 26257 states and 79967 transitions. Word has length 70 [2018-12-31 20:27:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:11,008 INFO L480 AbstractCegarLoop]: Abstraction has 26257 states and 79967 transitions. [2018-12-31 20:27:11,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 26257 states and 79967 transitions. [2018-12-31 20:27:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:27:11,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:11,025 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] [2018-12-31 20:27:11,025 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2018-12-31 20:27:11,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:11,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:11,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:11,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 20:27:11,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:11,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:11,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:11,451 INFO L87 Difference]: Start difference. First operand 26257 states and 79967 transitions. Second operand 5 states. [2018-12-31 20:27:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:12,465 INFO L93 Difference]: Finished difference Result 35347 states and 106727 transitions. [2018-12-31 20:27:12,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:27:12,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:27:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:12,533 INFO L225 Difference]: With dead ends: 35347 [2018-12-31 20:27:12,533 INFO L226 Difference]: Without dead ends: 35347 [2018-12-31 20:27:12,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35347 states. [2018-12-31 20:27:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35347 to 28671. [2018-12-31 20:27:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28671 states. [2018-12-31 20:27:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28671 states to 28671 states and 86974 transitions. [2018-12-31 20:27:13,049 INFO L78 Accepts]: Start accepts. Automaton has 28671 states and 86974 transitions. Word has length 70 [2018-12-31 20:27:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:13,049 INFO L480 AbstractCegarLoop]: Abstraction has 28671 states and 86974 transitions. [2018-12-31 20:27:13,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 28671 states and 86974 transitions. [2018-12-31 20:27:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:27:13,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:13,064 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] [2018-12-31 20:27:13,064 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:13,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:13,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2018-12-31 20:27:13,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:13,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:13,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:13,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:13,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:13,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:13,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:13,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:13,282 INFO L87 Difference]: Start difference. First operand 28671 states and 86974 transitions. Second operand 5 states. [2018-12-31 20:27:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:13,377 INFO L93 Difference]: Finished difference Result 8611 states and 21473 transitions. [2018-12-31 20:27:13,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:27:13,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-31 20:27:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:13,387 INFO L225 Difference]: With dead ends: 8611 [2018-12-31 20:27:13,387 INFO L226 Difference]: Without dead ends: 6783 [2018-12-31 20:27:13,388 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 20:27:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2018-12-31 20:27:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 5764. [2018-12-31 20:27:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2018-12-31 20:27:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 14037 transitions. [2018-12-31 20:27:13,464 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 14037 transitions. Word has length 70 [2018-12-31 20:27:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:13,465 INFO L480 AbstractCegarLoop]: Abstraction has 5764 states and 14037 transitions. [2018-12-31 20:27:13,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 14037 transitions. [2018-12-31 20:27:13,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 20:27:13,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:13,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] [2018-12-31 20:27:13,472 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2018-12-31 20:27:13,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:13,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:13,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:13,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:13,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:13,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:27:13,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:27:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:27:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:27:13,521 INFO L87 Difference]: Start difference. First operand 5764 states and 14037 transitions. Second operand 3 states. [2018-12-31 20:27:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:13,573 INFO L93 Difference]: Finished difference Result 7836 states and 18976 transitions. [2018-12-31 20:27:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:27:13,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-31 20:27:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:13,584 INFO L225 Difference]: With dead ends: 7836 [2018-12-31 20:27:13,584 INFO L226 Difference]: Without dead ends: 7836 [2018-12-31 20:27:13,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:27:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2018-12-31 20:27:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 5665. [2018-12-31 20:27:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5665 states. [2018-12-31 20:27:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 13522 transitions. [2018-12-31 20:27:13,662 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 13522 transitions. Word has length 70 [2018-12-31 20:27:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:13,663 INFO L480 AbstractCegarLoop]: Abstraction has 5665 states and 13522 transitions. [2018-12-31 20:27:13,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:27:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 13522 transitions. [2018-12-31 20:27:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 20:27:13,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:13,669 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] [2018-12-31 20:27:13,669 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2018-12-31 20:27:13,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:13,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:13,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:13,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:13,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:13,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:13,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:13,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:13,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:13,982 INFO L87 Difference]: Start difference. First operand 5665 states and 13522 transitions. Second operand 5 states. [2018-12-31 20:27:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:14,196 INFO L93 Difference]: Finished difference Result 6725 states and 16031 transitions. [2018-12-31 20:27:14,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:27:14,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-31 20:27:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:14,207 INFO L225 Difference]: With dead ends: 6725 [2018-12-31 20:27:14,207 INFO L226 Difference]: Without dead ends: 6725 [2018-12-31 20:27:14,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:27:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2018-12-31 20:27:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 6143. [2018-12-31 20:27:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6143 states. [2018-12-31 20:27:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 14680 transitions. [2018-12-31 20:27:14,283 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 14680 transitions. Word has length 76 [2018-12-31 20:27:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:14,283 INFO L480 AbstractCegarLoop]: Abstraction has 6143 states and 14680 transitions. [2018-12-31 20:27:14,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 14680 transitions. [2018-12-31 20:27:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-31 20:27:14,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:14,290 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] [2018-12-31 20:27:14,290 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2018-12-31 20:27:14,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:14,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:14,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:14,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:14,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:14,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:14,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:27:14,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:27:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:27:14,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:27:14,486 INFO L87 Difference]: Start difference. First operand 6143 states and 14680 transitions. Second operand 7 states. [2018-12-31 20:27:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:15,311 INFO L93 Difference]: Finished difference Result 7017 states and 16575 transitions. [2018-12-31 20:27:15,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:27:15,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-31 20:27:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:15,325 INFO L225 Difference]: With dead ends: 7017 [2018-12-31 20:27:15,326 INFO L226 Difference]: Without dead ends: 6898 [2018-12-31 20:27:15,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 20:27:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2018-12-31 20:27:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 6153. [2018-12-31 20:27:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2018-12-31 20:27:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 14610 transitions. [2018-12-31 20:27:15,436 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 14610 transitions. Word has length 76 [2018-12-31 20:27:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:15,436 INFO L480 AbstractCegarLoop]: Abstraction has 6153 states and 14610 transitions. [2018-12-31 20:27:15,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:27:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 14610 transitions. [2018-12-31 20:27:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:27:15,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:15,448 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] [2018-12-31 20:27:15,449 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1287940265, now seen corresponding path program 1 times [2018-12-31 20:27:15,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:15,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:15,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:15,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:15,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:15,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:27:15,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:27:15,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:27:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:27:15,692 INFO L87 Difference]: Start difference. First operand 6153 states and 14610 transitions. Second operand 4 states. [2018-12-31 20:27:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:17,349 INFO L93 Difference]: Finished difference Result 9320 states and 22194 transitions. [2018-12-31 20:27:17,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:27:17,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 20:27:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:17,362 INFO L225 Difference]: With dead ends: 9320 [2018-12-31 20:27:17,362 INFO L226 Difference]: Without dead ends: 9320 [2018-12-31 20:27:17,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:27:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2018-12-31 20:27:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 7089. [2018-12-31 20:27:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7089 states. [2018-12-31 20:27:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7089 states to 7089 states and 16737 transitions. [2018-12-31 20:27:17,451 INFO L78 Accepts]: Start accepts. Automaton has 7089 states and 16737 transitions. Word has length 95 [2018-12-31 20:27:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:17,452 INFO L480 AbstractCegarLoop]: Abstraction has 7089 states and 16737 transitions. [2018-12-31 20:27:17,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:27:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7089 states and 16737 transitions. [2018-12-31 20:27:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:27:17,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:17,460 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] [2018-12-31 20:27:17,460 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash 886458727, now seen corresponding path program 2 times [2018-12-31 20:27:17,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:17,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:17,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:17,714 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 20:27:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:18,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:18,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:27:18,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:27:18,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:27:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:18,292 INFO L87 Difference]: Start difference. First operand 7089 states and 16737 transitions. Second operand 8 states. [2018-12-31 20:27:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:20,223 INFO L93 Difference]: Finished difference Result 21058 states and 50093 transitions. [2018-12-31 20:27:20,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 20:27:20,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-31 20:27:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:20,252 INFO L225 Difference]: With dead ends: 21058 [2018-12-31 20:27:20,252 INFO L226 Difference]: Without dead ends: 20994 [2018-12-31 20:27:20,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-12-31 20:27:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20994 states. [2018-12-31 20:27:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20994 to 11080. [2018-12-31 20:27:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2018-12-31 20:27:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 26841 transitions. [2018-12-31 20:27:20,447 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 26841 transitions. Word has length 95 [2018-12-31 20:27:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:20,448 INFO L480 AbstractCegarLoop]: Abstraction has 11080 states and 26841 transitions. [2018-12-31 20:27:20,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:27:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 26841 transitions. [2018-12-31 20:27:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:27:20,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:20,465 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] [2018-12-31 20:27:20,466 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:20,466 INFO L82 PathProgramCache]: Analyzing trace with hash -910492632, now seen corresponding path program 1 times [2018-12-31 20:27:20,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:20,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:20,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:20,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:27:20,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:20,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:20,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:27:20,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:27:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:27:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:27:20,686 INFO L87 Difference]: Start difference. First operand 11080 states and 26841 transitions. Second operand 4 states. [2018-12-31 20:27:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:20,857 INFO L93 Difference]: Finished difference Result 11101 states and 26408 transitions. [2018-12-31 20:27:20,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:27:20,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 20:27:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:20,871 INFO L225 Difference]: With dead ends: 11101 [2018-12-31 20:27:20,872 INFO L226 Difference]: Without dead ends: 11101 [2018-12-31 20:27:20,872 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 20:27:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11101 states. [2018-12-31 20:27:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11101 to 10380. [2018-12-31 20:27:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10380 states. [2018-12-31 20:27:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 24797 transitions. [2018-12-31 20:27:20,996 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 24797 transitions. Word has length 95 [2018-12-31 20:27:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:20,996 INFO L480 AbstractCegarLoop]: Abstraction has 10380 states and 24797 transitions. [2018-12-31 20:27:20,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:27:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 24797 transitions. [2018-12-31 20:27:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:27:21,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:21,011 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, 1] [2018-12-31 20:27:21,011 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1785876207, now seen corresponding path program 1 times [2018-12-31 20:27:21,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:21,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:21,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:21,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:21,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:21,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:27:21,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:27:21,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:27:21,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:27:21,239 INFO L87 Difference]: Start difference. First operand 10380 states and 24797 transitions. Second operand 7 states. [2018-12-31 20:27:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:21,990 INFO L93 Difference]: Finished difference Result 12618 states and 30195 transitions. [2018-12-31 20:27:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:27:21,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-31 20:27:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:22,008 INFO L225 Difference]: With dead ends: 12618 [2018-12-31 20:27:22,008 INFO L226 Difference]: Without dead ends: 12618 [2018-12-31 20:27:22,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:27:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2018-12-31 20:27:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 10481. [2018-12-31 20:27:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10481 states. [2018-12-31 20:27:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10481 states to 10481 states and 25223 transitions. [2018-12-31 20:27:22,158 INFO L78 Accepts]: Start accepts. Automaton has 10481 states and 25223 transitions. Word has length 97 [2018-12-31 20:27:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:22,158 INFO L480 AbstractCegarLoop]: Abstraction has 10481 states and 25223 transitions. [2018-12-31 20:27:22,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:27:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 10481 states and 25223 transitions. [2018-12-31 20:27:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:27:22,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:22,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:27:22,172 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1080620369, now seen corresponding path program 1 times [2018-12-31 20:27:22,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:22,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:22,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:22,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 20:27:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:22,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:22,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:22,364 INFO L87 Difference]: Start difference. First operand 10481 states and 25223 transitions. Second operand 5 states. [2018-12-31 20:27:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:22,539 INFO L93 Difference]: Finished difference Result 12192 states and 29184 transitions. [2018-12-31 20:27:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:27:22,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:27:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:22,555 INFO L225 Difference]: With dead ends: 12192 [2018-12-31 20:27:22,555 INFO L226 Difference]: Without dead ends: 12192 [2018-12-31 20:27:22,556 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 20:27:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12192 states. [2018-12-31 20:27:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12192 to 9299. [2018-12-31 20:27:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9299 states. [2018-12-31 20:27:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9299 states to 9299 states and 22343 transitions. [2018-12-31 20:27:22,696 INFO L78 Accepts]: Start accepts. Automaton has 9299 states and 22343 transitions. Word has length 97 [2018-12-31 20:27:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:22,696 INFO L480 AbstractCegarLoop]: Abstraction has 9299 states and 22343 transitions. [2018-12-31 20:27:22,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9299 states and 22343 transitions. [2018-12-31 20:27:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:27:22,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:22,707 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, 1] [2018-12-31 20:27:22,708 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:22,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1335356914, now seen corresponding path program 1 times [2018-12-31 20:27:22,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:22,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:22,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:22,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:22,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:22,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:22,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:22,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:22,948 INFO L87 Difference]: Start difference. First operand 9299 states and 22343 transitions. Second operand 5 states. [2018-12-31 20:27:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:23,558 INFO L93 Difference]: Finished difference Result 15539 states and 37182 transitions. [2018-12-31 20:27:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:27:23,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:27:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:23,582 INFO L225 Difference]: With dead ends: 15539 [2018-12-31 20:27:23,582 INFO L226 Difference]: Without dead ends: 15416 [2018-12-31 20:27:23,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:27:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15416 states. [2018-12-31 20:27:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15416 to 10715. [2018-12-31 20:27:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10715 states. [2018-12-31 20:27:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 25788 transitions. [2018-12-31 20:27:23,782 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 25788 transitions. Word has length 97 [2018-12-31 20:27:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:23,782 INFO L480 AbstractCegarLoop]: Abstraction has 10715 states and 25788 transitions. [2018-12-31 20:27:23,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 25788 transitions. [2018-12-31 20:27:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:27:23,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:23,797 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, 1] [2018-12-31 20:27:23,797 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:23,797 INFO L82 PathProgramCache]: Analyzing trace with hash -90592433, now seen corresponding path program 1 times [2018-12-31 20:27:23,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:23,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:23,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:23,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:23,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:24,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:24,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:27:24,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:27:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:27:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:27:24,247 INFO L87 Difference]: Start difference. First operand 10715 states and 25788 transitions. Second operand 9 states. [2018-12-31 20:27:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:25,035 INFO L93 Difference]: Finished difference Result 14843 states and 35647 transitions. [2018-12-31 20:27:25,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 20:27:25,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-31 20:27:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:25,055 INFO L225 Difference]: With dead ends: 14843 [2018-12-31 20:27:25,055 INFO L226 Difference]: Without dead ends: 14811 [2018-12-31 20:27:25,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-31 20:27:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14811 states. [2018-12-31 20:27:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14811 to 11461. [2018-12-31 20:27:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11461 states. [2018-12-31 20:27:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11461 states to 11461 states and 27360 transitions. [2018-12-31 20:27:25,214 INFO L78 Accepts]: Start accepts. Automaton has 11461 states and 27360 transitions. Word has length 97 [2018-12-31 20:27:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:25,215 INFO L480 AbstractCegarLoop]: Abstraction has 11461 states and 27360 transitions. [2018-12-31 20:27:25,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:27:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 11461 states and 27360 transitions. [2018-12-31 20:27:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:27:25,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:25,226 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, 1] [2018-12-31 20:27:25,226 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:25,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1887543792, now seen corresponding path program 1 times [2018-12-31 20:27:25,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:25,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:25,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:25,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:25,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:27:25,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:27:25,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:27:25,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:25,774 INFO L87 Difference]: Start difference. First operand 11461 states and 27360 transitions. Second operand 8 states. [2018-12-31 20:27:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:26,510 INFO L93 Difference]: Finished difference Result 17621 states and 42463 transitions. [2018-12-31 20:27:26,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 20:27:26,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-12-31 20:27:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:26,536 INFO L225 Difference]: With dead ends: 17621 [2018-12-31 20:27:26,536 INFO L226 Difference]: Without dead ends: 17621 [2018-12-31 20:27:26,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-12-31 20:27:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2018-12-31 20:27:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 12115. [2018-12-31 20:27:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12115 states. [2018-12-31 20:27:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12115 states to 12115 states and 29102 transitions. [2018-12-31 20:27:26,728 INFO L78 Accepts]: Start accepts. Automaton has 12115 states and 29102 transitions. Word has length 97 [2018-12-31 20:27:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:26,728 INFO L480 AbstractCegarLoop]: Abstraction has 12115 states and 29102 transitions. [2018-12-31 20:27:26,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:27:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 12115 states and 29102 transitions. [2018-12-31 20:27:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:27:26,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:26,744 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, 1] [2018-12-31 20:27:26,744 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1000040111, now seen corresponding path program 1 times [2018-12-31 20:27:26,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:26,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:26,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:26,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:26,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:27,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:27,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:27:27,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:27:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:27:27,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:27:27,076 INFO L87 Difference]: Start difference. First operand 12115 states and 29102 transitions. Second operand 7 states. [2018-12-31 20:27:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:27,289 INFO L93 Difference]: Finished difference Result 15730 states and 37756 transitions. [2018-12-31 20:27:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:27:27,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-31 20:27:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:27,311 INFO L225 Difference]: With dead ends: 15730 [2018-12-31 20:27:27,311 INFO L226 Difference]: Without dead ends: 15730 [2018-12-31 20:27:27,311 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 20:27:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2018-12-31 20:27:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 11745. [2018-12-31 20:27:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11745 states. [2018-12-31 20:27:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11745 states to 11745 states and 27949 transitions. [2018-12-31 20:27:27,462 INFO L78 Accepts]: Start accepts. Automaton has 11745 states and 27949 transitions. Word has length 97 [2018-12-31 20:27:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:27,462 INFO L480 AbstractCegarLoop]: Abstraction has 11745 states and 27949 transitions. [2018-12-31 20:27:27,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:27:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 11745 states and 27949 transitions. [2018-12-31 20:27:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:27:27,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:27,476 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, 1] [2018-12-31 20:27:27,476 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:27,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:27,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1562951633, now seen corresponding path program 1 times [2018-12-31 20:27:27,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:27,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:27,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:27,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:27,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:27,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:27:27,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:27:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:27:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:27:27,788 INFO L87 Difference]: Start difference. First operand 11745 states and 27949 transitions. Second operand 6 states. [2018-12-31 20:27:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:27,948 INFO L93 Difference]: Finished difference Result 11473 states and 26997 transitions. [2018-12-31 20:27:27,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:27:27,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-31 20:27:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:27,965 INFO L225 Difference]: With dead ends: 11473 [2018-12-31 20:27:27,965 INFO L226 Difference]: Without dead ends: 11473 [2018-12-31 20:27:27,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11473 states. [2018-12-31 20:27:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11473 to 6898. [2018-12-31 20:27:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6898 states. [2018-12-31 20:27:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6898 states to 6898 states and 16208 transitions. [2018-12-31 20:27:28,084 INFO L78 Accepts]: Start accepts. Automaton has 6898 states and 16208 transitions. Word has length 97 [2018-12-31 20:27:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:28,085 INFO L480 AbstractCegarLoop]: Abstraction has 6898 states and 16208 transitions. [2018-12-31 20:27:28,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:27:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6898 states and 16208 transitions. [2018-12-31 20:27:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:27:28,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:28,093 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, 1, 1, 1] [2018-12-31 20:27:28,093 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash -529897289, now seen corresponding path program 1 times [2018-12-31 20:27:28,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:28,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:28,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:28,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:28,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:28,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:28,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:28,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:28,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:28,243 INFO L87 Difference]: Start difference. First operand 6898 states and 16208 transitions. Second operand 5 states. [2018-12-31 20:27:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:28,295 INFO L93 Difference]: Finished difference Result 6898 states and 16192 transitions. [2018-12-31 20:27:28,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:27:28,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-31 20:27:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:28,306 INFO L225 Difference]: With dead ends: 6898 [2018-12-31 20:27:28,306 INFO L226 Difference]: Without dead ends: 6898 [2018-12-31 20:27:28,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:27:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2018-12-31 20:27:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 6898. [2018-12-31 20:27:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6898 states. [2018-12-31 20:27:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6898 states to 6898 states and 16192 transitions. [2018-12-31 20:27:28,376 INFO L78 Accepts]: Start accepts. Automaton has 6898 states and 16192 transitions. Word has length 99 [2018-12-31 20:27:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:28,376 INFO L480 AbstractCegarLoop]: Abstraction has 6898 states and 16192 transitions. [2018-12-31 20:27:28,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 6898 states and 16192 transitions. [2018-12-31 20:27:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:27:28,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:28,383 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, 1, 1, 1] [2018-12-31 20:27:28,384 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 357606392, now seen corresponding path program 1 times [2018-12-31 20:27:28,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:28,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:28,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:28,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 20:27:28,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 20:27:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 20:27:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:27:28,620 INFO L87 Difference]: Start difference. First operand 6898 states and 16192 transitions. Second operand 10 states. [2018-12-31 20:27:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:29,731 INFO L93 Difference]: Finished difference Result 10098 states and 23589 transitions. [2018-12-31 20:27:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:27:29,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-12-31 20:27:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:29,743 INFO L225 Difference]: With dead ends: 10098 [2018-12-31 20:27:29,743 INFO L226 Difference]: Without dead ends: 7636 [2018-12-31 20:27:29,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-31 20:27:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7636 states. [2018-12-31 20:27:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7636 to 7031. [2018-12-31 20:27:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7031 states. [2018-12-31 20:27:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7031 states to 7031 states and 16465 transitions. [2018-12-31 20:27:29,830 INFO L78 Accepts]: Start accepts. Automaton has 7031 states and 16465 transitions. Word has length 99 [2018-12-31 20:27:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:29,831 INFO L480 AbstractCegarLoop]: Abstraction has 7031 states and 16465 transitions. [2018-12-31 20:27:29,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 20:27:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7031 states and 16465 transitions. [2018-12-31 20:27:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:27:29,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:29,840 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, 1, 1, 1] [2018-12-31 20:27:29,840 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1814131433, now seen corresponding path program 1 times [2018-12-31 20:27:29,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:29,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:29,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:30,253 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:27:30,737 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 20:27:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:30,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:30,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:27:30,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:27:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:27:30,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:27:30,772 INFO L87 Difference]: Start difference. First operand 7031 states and 16465 transitions. Second operand 6 states. [2018-12-31 20:27:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:31,420 INFO L93 Difference]: Finished difference Result 7574 states and 17039 transitions. [2018-12-31 20:27:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:27:31,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-31 20:27:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:31,431 INFO L225 Difference]: With dead ends: 7574 [2018-12-31 20:27:31,431 INFO L226 Difference]: Without dead ends: 7544 [2018-12-31 20:27:31,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:27:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2018-12-31 20:27:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6153. [2018-12-31 20:27:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2018-12-31 20:27:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 13981 transitions. [2018-12-31 20:27:31,514 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 13981 transitions. Word has length 99 [2018-12-31 20:27:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:31,514 INFO L480 AbstractCegarLoop]: Abstraction has 6153 states and 13981 transitions. [2018-12-31 20:27:31,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:27:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 13981 transitions. [2018-12-31 20:27:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:27:31,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:31,522 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, 1, 1, 1] [2018-12-31 20:27:31,522 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:31,523 INFO L82 PathProgramCache]: Analyzing trace with hash -705952148, now seen corresponding path program 1 times [2018-12-31 20:27:31,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:31,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:31,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:31,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:31,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:31,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:31,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:27:31,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:27:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:27:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:27:31,870 INFO L87 Difference]: Start difference. First operand 6153 states and 13981 transitions. Second operand 5 states. [2018-12-31 20:27:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:32,574 INFO L93 Difference]: Finished difference Result 7074 states and 15967 transitions. [2018-12-31 20:27:32,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:27:32,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-31 20:27:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:32,585 INFO L225 Difference]: With dead ends: 7074 [2018-12-31 20:27:32,585 INFO L226 Difference]: Without dead ends: 7026 [2018-12-31 20:27:32,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2018-12-31 20:27:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 5662. [2018-12-31 20:27:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5662 states. [2018-12-31 20:27:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5662 states to 5662 states and 12945 transitions. [2018-12-31 20:27:32,659 INFO L78 Accepts]: Start accepts. Automaton has 5662 states and 12945 transitions. Word has length 99 [2018-12-31 20:27:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:32,660 INFO L480 AbstractCegarLoop]: Abstraction has 5662 states and 12945 transitions. [2018-12-31 20:27:32,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:27:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5662 states and 12945 transitions. [2018-12-31 20:27:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:27:32,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:32,666 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, 1, 1, 1] [2018-12-31 20:27:32,667 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:32,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:32,667 INFO L82 PathProgramCache]: Analyzing trace with hash -12850451, now seen corresponding path program 2 times [2018-12-31 20:27:32,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:32,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:32,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:27:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:32,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:32,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:27:32,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:27:32,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:27:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:27:32,813 INFO L87 Difference]: Start difference. First operand 5662 states and 12945 transitions. Second operand 6 states. [2018-12-31 20:27:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:33,025 INFO L93 Difference]: Finished difference Result 6087 states and 13810 transitions. [2018-12-31 20:27:33,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:27:33,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-31 20:27:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:33,034 INFO L225 Difference]: With dead ends: 6087 [2018-12-31 20:27:33,034 INFO L226 Difference]: Without dead ends: 6087 [2018-12-31 20:27:33,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:27:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6087 states. [2018-12-31 20:27:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6087 to 5827. [2018-12-31 20:27:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5827 states. [2018-12-31 20:27:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 13241 transitions. [2018-12-31 20:27:33,103 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 13241 transitions. Word has length 99 [2018-12-31 20:27:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:33,104 INFO L480 AbstractCegarLoop]: Abstraction has 5827 states and 13241 transitions. [2018-12-31 20:27:33,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:27:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 13241 transitions. [2018-12-31 20:27:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:27:33,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:33,112 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, 1, 1, 1] [2018-12-31 20:27:33,112 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:33,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2032139224, now seen corresponding path program 2 times [2018-12-31 20:27:33,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:33,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:33,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:33,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:27:33,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:33,445 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 20:27:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:33,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:33,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:27:33,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:27:33,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:27:33,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:27:33,763 INFO L87 Difference]: Start difference. First operand 5827 states and 13241 transitions. Second operand 9 states. [2018-12-31 20:27:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:33,978 INFO L93 Difference]: Finished difference Result 9016 states and 20529 transitions. [2018-12-31 20:27:33,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:27:33,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-31 20:27:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:33,985 INFO L225 Difference]: With dead ends: 9016 [2018-12-31 20:27:33,985 INFO L226 Difference]: Without dead ends: 3400 [2018-12-31 20:27:33,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-31 20:27:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2018-12-31 20:27:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3400. [2018-12-31 20:27:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-12-31 20:27:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 7709 transitions. [2018-12-31 20:27:34,022 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 7709 transitions. Word has length 99 [2018-12-31 20:27:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:34,022 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 7709 transitions. [2018-12-31 20:27:34,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:27:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 7709 transitions. [2018-12-31 20:27:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:27:34,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:34,027 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, 1, 1, 1] [2018-12-31 20:27:34,027 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:34,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1960406580, now seen corresponding path program 3 times [2018-12-31 20:27:34,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:34,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:34,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:34,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:27:34,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:27:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:27:34,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:27:34,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:27:34,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:27:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:27:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:27:34,243 INFO L87 Difference]: Start difference. First operand 3400 states and 7709 transitions. Second operand 11 states. [2018-12-31 20:27:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:27:35,205 INFO L93 Difference]: Finished difference Result 7021 states and 15984 transitions. [2018-12-31 20:27:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:27:35,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-31 20:27:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:27:35,213 INFO L225 Difference]: With dead ends: 7021 [2018-12-31 20:27:35,213 INFO L226 Difference]: Without dead ends: 4528 [2018-12-31 20:27:35,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 20:27:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2018-12-31 20:27:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 3431. [2018-12-31 20:27:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3431 states. [2018-12-31 20:27:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 7725 transitions. [2018-12-31 20:27:35,256 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 7725 transitions. Word has length 99 [2018-12-31 20:27:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:27:35,257 INFO L480 AbstractCegarLoop]: Abstraction has 3431 states and 7725 transitions. [2018-12-31 20:27:35,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:27:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 7725 transitions. [2018-12-31 20:27:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 20:27:35,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:27:35,261 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, 1, 1, 1] [2018-12-31 20:27:35,262 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:27:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:27:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash 138150868, now seen corresponding path program 4 times [2018-12-31 20:27:35,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:27:35,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:27:35,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:35,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:27:35,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:27:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:27:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:27:35,363 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:27:35,545 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:27:35,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:27:35 BasicIcfg [2018-12-31 20:27:35,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:27:35,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:27:35,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:27:35,551 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:27:35,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:26:31" (3/4) ... [2018-12-31 20:27:35,556 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:27:35,760 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:27:35,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:27:35,765 INFO L168 Benchmark]: Toolchain (without parser) took 66949.61 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 946.0 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-31 20:27:35,766 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:27:35,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-31 20:27:35,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 20:27:35,767 INFO L168 Benchmark]: Boogie Preprocessor took 45.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:27:35,767 INFO L168 Benchmark]: RCFGBuilder took 1243.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2018-12-31 20:27:35,771 INFO L168 Benchmark]: TraceAbstraction took 64519.99 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-31 20:27:35,772 INFO L168 Benchmark]: Witness Printer took 215.28 ms. Allocated memory is still 4.5 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2018-12-31 20:27:35,774 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 851.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1243.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64519.99 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 215.28 ms. Allocated memory is still 4.5 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t835; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t836; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 64.3s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 34.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9916 SDtfs, 11207 SDslu, 24275 SDs, 0 SdLazy, 10473 SolverSat, 621 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 97 SyntacticMatches, 29 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74884occurred 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: 16.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 149725 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 2934 NumberOfCodeBlocks, 2934 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2799 ConstructedInterpolants, 0 QuantifiedInterpolants, 680140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...