./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_pso.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/mix012_pso.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 61ec1444beade6c173560e18fc764e1e87b48a40 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 18:34:36,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 18:34:36,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 18:34:36,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 18:34:36,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 18:34:36,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 18:34:36,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 18:34:36,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 18:34:36,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 18:34:36,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 18:34:36,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 18:34:36,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 18:34:36,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 18:34:36,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 18:34:36,760 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 18:34:36,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 18:34:36,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 18:34:36,763 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 18:34:36,765 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 18:34:36,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 18:34:36,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 18:34:36,770 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 18:34:36,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 18:34:36,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 18:34:36,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 18:34:36,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 18:34:36,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 18:34:36,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 18:34:36,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 18:34:36,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 18:34:36,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 18:34:36,779 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 18:34:36,779 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 18:34:36,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 18:34:36,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 18:34:36,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 18:34:36,782 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 18:34:36,798 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 18:34:36,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 18:34:36,800 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 18:34:36,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 18:34:36,800 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 18:34:36,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 18:34:36,801 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 18:34:36,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 18:34:36,801 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 18:34:36,801 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 18:34:36,802 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 18:34:36,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 18:34:36,802 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 18:34:36,802 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 18:34:36,802 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 18:34:36,803 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 18:34:36,803 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 18:34:36,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 18:34:36,803 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 18:34:36,804 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 18:34:36,804 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 18:34:36,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:34:36,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 18:34:36,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 18:34:36,805 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 18:34:36,805 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 18:34:36,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 18:34:36,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 18:34:36,805 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 -> 61ec1444beade6c173560e18fc764e1e87b48a40 [2018-12-31 18:34:36,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 18:34:36,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 18:34:36,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 18:34:36,861 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 18:34:36,862 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 18:34:36,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i [2018-12-31 18:34:36,931 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba3ff9a1/938b3f5aaf2041c782c678248f03e849/FLAG9db934eeb [2018-12-31 18:34:37,515 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 18:34:37,516 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i [2018-12-31 18:34:37,535 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba3ff9a1/938b3f5aaf2041c782c678248f03e849/FLAG9db934eeb [2018-12-31 18:34:37,739 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba3ff9a1/938b3f5aaf2041c782c678248f03e849 [2018-12-31 18:34:37,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 18:34:37,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 18:34:37,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 18:34:37,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 18:34:37,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 18:34:37,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:37,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a35997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37, skipping insertion in model container [2018-12-31 18:34:37,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:37,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 18:34:37,842 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 18:34:38,333 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:34:38,362 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 18:34:38,556 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:34:38,654 INFO L195 MainTranslator]: Completed translation [2018-12-31 18:34:38,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38 WrapperNode [2018-12-31 18:34:38,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 18:34:38,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 18:34:38,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 18:34:38,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 18:34:38,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 18:34:38,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 18:34:38,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 18:34:38,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 18:34:38,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... [2018-12-31 18:34:38,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 18:34:38,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 18:34:38,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 18:34:38,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 18:34:38,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:34:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 18:34:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 18:34:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 18:34:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 18:34:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 18:34:38,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 18:34:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 18:34:38,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 18:34:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 18:34:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 18:34:38,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 18:34:38,899 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 18:34:40,305 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 18:34:40,306 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 18:34:40,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:34:40 BoogieIcfgContainer [2018-12-31 18:34:40,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 18:34:40,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 18:34:40,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 18:34:40,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 18:34:40,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:34:37" (1/3) ... [2018-12-31 18:34:40,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6159674e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:34:40, skipping insertion in model container [2018-12-31 18:34:40,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:38" (2/3) ... [2018-12-31 18:34:40,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6159674e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:34:40, skipping insertion in model container [2018-12-31 18:34:40,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:34:40" (3/3) ... [2018-12-31 18:34:40,318 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.oepc_false-unreach-call.i [2018-12-31 18:34:40,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,367 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,367 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,367 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,368 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,368 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,383 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,383 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:40,463 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 18:34:40,463 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 18:34:40,474 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 18:34:40,493 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 18:34:40,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 18:34:40,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 18:34:40,520 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 18:34:40,521 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 18:34:40,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 18:34:40,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 18:34:40,521 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 18:34:40,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 18:34:40,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 18:34:40,539 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 18:34:43,555 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-31 18:34:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-31 18:34:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 18:34:43,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:43,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:43,572 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-31 18:34:43,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:43,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:43,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:44,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:44,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:34:44,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:34:44,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:34:44,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:34:44,043 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-31 18:34:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:45,758 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-31 18:34:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:34:45,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-31 18:34:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:46,123 INFO L225 Difference]: With dead ends: 60791 [2018-12-31 18:34:46,123 INFO L226 Difference]: Without dead ends: 44271 [2018-12-31 18:34:46,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:34:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-31 18:34:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-31 18:34:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-31 18:34:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-31 18:34:48,335 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-31 18:34:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:34:48,337 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-31 18:34:48,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:34:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-31 18:34:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 18:34:48,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:48,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:48,357 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-31 18:34:48,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:48,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:48,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:48,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:48,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:48,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:48,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:34:48,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:34:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:34:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:34:48,709 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-31 18:34:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:50,978 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-31 18:34:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:34:50,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 18:34:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:51,985 INFO L225 Difference]: With dead ends: 64005 [2018-12-31 18:34:51,985 INFO L226 Difference]: Without dead ends: 63453 [2018-12-31 18:34:51,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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 18:34:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-31 18:34:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-31 18:34:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-31 18:34:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-31 18:34:53,617 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-31 18:34:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:34:53,619 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-31 18:34:53,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:34:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-31 18:34:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 18:34:53,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:53,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:53,626 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:53,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:53,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-31 18:34:53,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:53,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:53,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:53,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:53,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:53,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:53,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:34:53,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:34:53,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:34:53,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:34:53,769 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-31 18:34:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:55,276 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-31 18:34:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:34:55,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 18:34:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:55,548 INFO L225 Difference]: With dead ends: 81367 [2018-12-31 18:34:55,548 INFO L226 Difference]: Without dead ends: 80855 [2018-12-31 18:34:55,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:34:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-31 18:34:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-31 18:34:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-31 18:34:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-31 18:34:57,835 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-31 18:34:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:34:57,836 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-31 18:34:57,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:34:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-31 18:34:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 18:34:57,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:57,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:57,846 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-31 18:34:57,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:57,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:34:57,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:34:57,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:34:57,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:34:57,930 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-31 18:34:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:58,288 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-31 18:34:58,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:34:58,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 18:34:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:58,501 INFO L225 Difference]: With dead ends: 65251 [2018-12-31 18:34:58,501 INFO L226 Difference]: Without dead ends: 65251 [2018-12-31 18:34:58,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:34:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-31 18:35:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-31 18:35:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-31 18:35:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-31 18:35:00,738 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-31 18:35:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:00,738 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-31 18:35:00,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-31 18:35:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:00,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:00,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:00,758 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:00,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-31 18:35:00,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:00,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:00,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:00,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:00,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:00,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:00,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:00,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:00,985 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-31 18:35:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:02,421 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-31 18:35:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:02,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 18:35:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:02,619 INFO L225 Difference]: With dead ends: 67511 [2018-12-31 18:35:02,620 INFO L226 Difference]: Without dead ends: 67511 [2018-12-31 18:35:02,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-31 18:35:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-31 18:35:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-31 18:35:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-31 18:35:05,017 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-31 18:35:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:05,018 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-31 18:35:05,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-31 18:35:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:05,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:05,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:05,038 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-31 18:35:05,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:05,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:05,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:05,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:05,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:05,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:05,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:05,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:05,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:05,201 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-31 18:35:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:06,808 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-31 18:35:06,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:35:06,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-31 18:35:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:07,045 INFO L225 Difference]: With dead ends: 88528 [2018-12-31 18:35:07,046 INFO L226 Difference]: Without dead ends: 88528 [2018-12-31 18:35:07,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:35:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-31 18:35:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-31 18:35:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-31 18:35:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-31 18:35:08,700 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-31 18:35:08,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:08,701 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-31 18:35:08,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-31 18:35:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:08,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:08,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:08,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-31 18:35:08,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:08,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:08,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:08,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:08,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:08,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:08,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:08,881 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 4 states. [2018-12-31 18:35:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:09,199 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2018-12-31 18:35:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:09,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-31 18:35:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:09,233 INFO L225 Difference]: With dead ends: 15375 [2018-12-31 18:35:09,234 INFO L226 Difference]: Without dead ends: 13789 [2018-12-31 18:35:09,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-31 18:35:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-31 18:35:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-31 18:35:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2018-12-31 18:35:09,920 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2018-12-31 18:35:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:09,921 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2018-12-31 18:35:09,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2018-12-31 18:35:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:09,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:09,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:09,923 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-31 18:35:09,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:09,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:09,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:10,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:10,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:10,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:10,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:10,070 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2018-12-31 18:35:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:10,898 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2018-12-31 18:35:10,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:10,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 18:35:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:10,939 INFO L225 Difference]: With dead ends: 19970 [2018-12-31 18:35:10,939 INFO L226 Difference]: Without dead ends: 19898 [2018-12-31 18:35:10,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:35:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-31 18:35:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-31 18:35:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-31 18:35:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2018-12-31 18:35:11,205 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2018-12-31 18:35:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:11,206 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2018-12-31 18:35:11,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2018-12-31 18:35:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 18:35:11,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:11,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:11,211 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-31 18:35:11,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:11,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:11,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:11,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:11,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:11,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:11,449 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2018-12-31 18:35:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:11,880 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2018-12-31 18:35:11,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:11,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-31 18:35:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:11,912 INFO L225 Difference]: With dead ends: 16617 [2018-12-31 18:35:11,912 INFO L226 Difference]: Without dead ends: 16617 [2018-12-31 18:35:11,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-31 18:35:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-31 18:35:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-31 18:35:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2018-12-31 18:35:12,169 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2018-12-31 18:35:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:12,170 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2018-12-31 18:35:12,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2018-12-31 18:35:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 18:35:12,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:12,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:12,176 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:12,177 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-31 18:35:12,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:12,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:12,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:12,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:12,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:12,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:12,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:12,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:12,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:12,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:12,318 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2018-12-31 18:35:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:13,020 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2018-12-31 18:35:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:13,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-31 18:35:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:13,075 INFO L225 Difference]: With dead ends: 28106 [2018-12-31 18:35:13,075 INFO L226 Difference]: Without dead ends: 28035 [2018-12-31 18:35:13,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:35:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-31 18:35:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-31 18:35:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-31 18:35:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2018-12-31 18:35:13,426 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2018-12-31 18:35:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:13,427 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2018-12-31 18:35:13,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2018-12-31 18:35:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 18:35:13,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:13,434 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] [2018-12-31 18:35:13,435 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2056127163, now seen corresponding path program 1 times [2018-12-31 18:35:13,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:13,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:13,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:13,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:13,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:13,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:13,583 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2018-12-31 18:35:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:14,039 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2018-12-31 18:35:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:14,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-31 18:35:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:14,078 INFO L225 Difference]: With dead ends: 18092 [2018-12-31 18:35:14,078 INFO L226 Difference]: Without dead ends: 18092 [2018-12-31 18:35:14,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-31 18:35:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-31 18:35:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-31 18:35:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2018-12-31 18:35:14,329 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2018-12-31 18:35:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:14,330 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2018-12-31 18:35:14,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2018-12-31 18:35:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 18:35:14,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:14,337 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] [2018-12-31 18:35:14,337 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:14,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash 21082180, now seen corresponding path program 1 times [2018-12-31 18:35:14,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:14,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:14,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:14,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:14,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:14,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:14,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:14,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:14,557 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2018-12-31 18:35:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:15,279 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2018-12-31 18:35:15,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:15,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-31 18:35:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:15,316 INFO L225 Difference]: With dead ends: 21696 [2018-12-31 18:35:15,317 INFO L226 Difference]: Without dead ends: 21696 [2018-12-31 18:35:15,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-31 18:35:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-31 18:35:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-31 18:35:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2018-12-31 18:35:15,628 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2018-12-31 18:35:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:15,629 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2018-12-31 18:35:15,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2018-12-31 18:35:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:15,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:15,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:15,642 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1344510516, now seen corresponding path program 1 times [2018-12-31 18:35:15,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:15,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:15,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:15,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:15,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:15,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:15,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:15,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:15,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:15,903 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2018-12-31 18:35:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:17,325 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2018-12-31 18:35:17,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:17,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 18:35:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:17,376 INFO L225 Difference]: With dead ends: 23814 [2018-12-31 18:35:17,376 INFO L226 Difference]: Without dead ends: 23814 [2018-12-31 18:35:17,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-31 18:35:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-31 18:35:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-31 18:35:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2018-12-31 18:35:17,724 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2018-12-31 18:35:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:17,724 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2018-12-31 18:35:17,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2018-12-31 18:35:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:17,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:17,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:17,737 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:17,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash 873247437, now seen corresponding path program 1 times [2018-12-31 18:35:17,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:17,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:17,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:17,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:17,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:18,148 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 18:35:18,408 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 18:35:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:18,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:18,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:18,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:18,417 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2018-12-31 18:35:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:19,035 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2018-12-31 18:35:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:35:19,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 18:35:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:19,083 INFO L225 Difference]: With dead ends: 25702 [2018-12-31 18:35:19,083 INFO L226 Difference]: Without dead ends: 25702 [2018-12-31 18:35:19,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:35:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-31 18:35:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-31 18:35:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-31 18:35:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2018-12-31 18:35:19,441 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2018-12-31 18:35:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:19,441 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2018-12-31 18:35:19,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2018-12-31 18:35:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:19,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:19,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:19,453 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:19,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:19,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1084598350, now seen corresponding path program 1 times [2018-12-31 18:35:19,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:19,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:19,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:19,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:19,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:19,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:19,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:19,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:19,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:19,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:19,593 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2018-12-31 18:35:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:20,158 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2018-12-31 18:35:20,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:20,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:35:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:20,214 INFO L225 Difference]: With dead ends: 29793 [2018-12-31 18:35:20,214 INFO L226 Difference]: Without dead ends: 29793 [2018-12-31 18:35:20,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-31 18:35:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-31 18:35:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-31 18:35:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2018-12-31 18:35:20,645 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2018-12-31 18:35:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:20,645 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2018-12-31 18:35:20,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2018-12-31 18:35:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:20,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:20,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:20,660 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:20,662 INFO L82 PathProgramCache]: Analyzing trace with hash 574064173, now seen corresponding path program 1 times [2018-12-31 18:35:20,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:20,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:20,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:20,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:20,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:20,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 18:35:20,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:20,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:20,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:20,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:20,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:20,772 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2018-12-31 18:35:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:21,419 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2018-12-31 18:35:21,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:21,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:35:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:21,490 INFO L225 Difference]: With dead ends: 36420 [2018-12-31 18:35:21,490 INFO L226 Difference]: Without dead ends: 36420 [2018-12-31 18:35:21,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-31 18:35:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-31 18:35:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-31 18:35:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2018-12-31 18:35:22,009 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2018-12-31 18:35:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:22,010 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2018-12-31 18:35:22,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2018-12-31 18:35:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:22,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:22,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:22,024 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-31 18:35:22,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:22,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:22,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:22,355 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-12-31 18:35:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:22,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:22,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:22,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:22,362 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 4 states. [2018-12-31 18:35:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:23,749 INFO L93 Difference]: Finished difference Result 39012 states and 116891 transitions. [2018-12-31 18:35:23,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:23,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 18:35:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:23,834 INFO L225 Difference]: With dead ends: 39012 [2018-12-31 18:35:23,834 INFO L226 Difference]: Without dead ends: 38780 [2018-12-31 18:35:23,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38780 states. [2018-12-31 18:35:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38780 to 35900. [2018-12-31 18:35:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35900 states. [2018-12-31 18:35:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35900 states to 35900 states and 107661 transitions. [2018-12-31 18:35:24,486 INFO L78 Accepts]: Start accepts. Automaton has 35900 states and 107661 transitions. Word has length 67 [2018-12-31 18:35:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:24,486 INFO L480 AbstractCegarLoop]: Abstraction has 35900 states and 107661 transitions. [2018-12-31 18:35:24,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35900 states and 107661 transitions. [2018-12-31 18:35:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:24,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:24,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:24,499 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-31 18:35:24,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:24,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:24,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:24,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:24,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:24,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:24,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:24,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:24,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:24,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:24,748 INFO L87 Difference]: Start difference. First operand 35900 states and 107661 transitions. Second operand 5 states. [2018-12-31 18:35:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:24,819 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-31 18:35:24,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:35:24,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:35:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:24,831 INFO L225 Difference]: With dead ends: 9316 [2018-12-31 18:35:24,831 INFO L226 Difference]: Without dead ends: 7464 [2018-12-31 18:35:24,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-31 18:35:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-31 18:35:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-31 18:35:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-31 18:35:24,909 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-31 18:35:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:24,909 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-31 18:35:24,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-31 18:35:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:24,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:24,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:24,915 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:24,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:24,915 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-31 18:35:24,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:24,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:24,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:24,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:24,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:24,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:24,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:24,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:24,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:24,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:24,988 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-31 18:35:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:25,045 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-31 18:35:25,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:25,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 18:35:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:25,056 INFO L225 Difference]: With dead ends: 8820 [2018-12-31 18:35:25,056 INFO L226 Difference]: Without dead ends: 8820 [2018-12-31 18:35:25,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-31 18:35:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-31 18:35:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-31 18:35:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-31 18:35:25,128 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-31 18:35:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:25,128 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-31 18:35:25,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-31 18:35:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 18:35:25,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:25,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:25,134 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:25,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:25,134 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-31 18:35:25,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:25,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:25,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:25,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:25,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:25,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:25,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:25,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:25,443 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-31 18:35:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:26,522 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-31 18:35:26,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:35:26,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-31 18:35:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:26,536 INFO L225 Difference]: With dead ends: 7470 [2018-12-31 18:35:26,536 INFO L226 Difference]: Without dead ends: 7470 [2018-12-31 18:35:26,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:35:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-31 18:35:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-31 18:35:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-31 18:35:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-31 18:35:26,698 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-31 18:35:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:26,698 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-31 18:35:26,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-31 18:35:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 18:35:26,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:26,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:26,709 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-31 18:35:26,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:26,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:26,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:26,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:26,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:26,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:26,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:26,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:26,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:26,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:26,881 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-31 18:35:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:27,348 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-31 18:35:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:35:27,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-31 18:35:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:27,360 INFO L225 Difference]: With dead ends: 7881 [2018-12-31 18:35:27,361 INFO L226 Difference]: Without dead ends: 7762 [2018-12-31 18:35:27,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 18:35:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-31 18:35:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-31 18:35:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-31 18:35:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-31 18:35:27,442 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-31 18:35:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:27,442 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-31 18:35:27,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-31 18:35:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 18:35:27,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:27,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:27,451 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:27,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1190095737, now seen corresponding path program 1 times [2018-12-31 18:35:27,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:27,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:27,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:27,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:27,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:27,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:27,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:27,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:27,542 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-31 18:35:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:27,891 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-31 18:35:27,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:27,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 18:35:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:27,910 INFO L225 Difference]: With dead ends: 10608 [2018-12-31 18:35:27,910 INFO L226 Difference]: Without dead ends: 10608 [2018-12-31 18:35:27,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-31 18:35:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-31 18:35:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-31 18:35:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-31 18:35:28,031 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-31 18:35:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:28,032 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-31 18:35:28,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-31 18:35:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 18:35:28,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:28,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:28,042 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1824690189, now seen corresponding path program 1 times [2018-12-31 18:35:28,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:28,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:28,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:28,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:28,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:28,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:28,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:28,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:28,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:28,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:28,152 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-31 18:35:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:28,274 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-31 18:35:28,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:28,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 18:35:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:28,286 INFO L225 Difference]: With dead ends: 8526 [2018-12-31 18:35:28,286 INFO L226 Difference]: Without dead ends: 8526 [2018-12-31 18:35:28,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-31 18:35:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-31 18:35:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-31 18:35:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-31 18:35:28,378 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-31 18:35:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:28,378 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-31 18:35:28,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-31 18:35:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:28,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:28,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:28,387 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2094563457, now seen corresponding path program 1 times [2018-12-31 18:35:28,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:28,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:28,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:28,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:28,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:28,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:28,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:28,612 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2018-12-31 18:35:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:29,066 INFO L93 Difference]: Finished difference Result 7433 states and 16736 transitions. [2018-12-31 18:35:29,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:35:29,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:35:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:29,077 INFO L225 Difference]: With dead ends: 7433 [2018-12-31 18:35:29,077 INFO L226 Difference]: Without dead ends: 7433 [2018-12-31 18:35:29,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2018-12-31 18:35:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7001. [2018-12-31 18:35:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7001 states. [2018-12-31 18:35:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 15799 transitions. [2018-12-31 18:35:29,155 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 15799 transitions. Word has length 94 [2018-12-31 18:35:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:29,156 INFO L480 AbstractCegarLoop]: Abstraction has 7001 states and 15799 transitions. [2018-12-31 18:35:29,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 15799 transitions. [2018-12-31 18:35:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:29,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:29,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:29,164 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1751651615, now seen corresponding path program 1 times [2018-12-31 18:35:29,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:29,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:29,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:29,419 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 18:35:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:29,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:29,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:35:29,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:35:29,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:35:29,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:29,725 INFO L87 Difference]: Start difference. First operand 7001 states and 15799 transitions. Second operand 8 states. [2018-12-31 18:35:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:32,532 INFO L93 Difference]: Finished difference Result 19264 states and 43254 transitions. [2018-12-31 18:35:32,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-31 18:35:32,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-31 18:35:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:32,557 INFO L225 Difference]: With dead ends: 19264 [2018-12-31 18:35:32,557 INFO L226 Difference]: Without dead ends: 19145 [2018-12-31 18:35:32,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2018-12-31 18:35:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19145 states. [2018-12-31 18:35:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19145 to 10407. [2018-12-31 18:35:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10407 states. [2018-12-31 18:35:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10407 states to 10407 states and 23675 transitions. [2018-12-31 18:35:32,732 INFO L78 Accepts]: Start accepts. Automaton has 10407 states and 23675 transitions. Word has length 94 [2018-12-31 18:35:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:32,732 INFO L480 AbstractCegarLoop]: Abstraction has 10407 states and 23675 transitions. [2018-12-31 18:35:32,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:35:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10407 states and 23675 transitions. [2018-12-31 18:35:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:32,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:32,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:32,745 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1298551200, now seen corresponding path program 1 times [2018-12-31 18:35:32,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:32,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:32,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:32,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:32,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:32,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:32,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:32,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:32,911 INFO L87 Difference]: Start difference. First operand 10407 states and 23675 transitions. Second operand 6 states. [2018-12-31 18:35:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:33,229 INFO L93 Difference]: Finished difference Result 11096 states and 24687 transitions. [2018-12-31 18:35:33,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:33,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 18:35:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:33,244 INFO L225 Difference]: With dead ends: 11096 [2018-12-31 18:35:33,245 INFO L226 Difference]: Without dead ends: 11056 [2018-12-31 18:35:33,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11056 states. [2018-12-31 18:35:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11056 to 9526. [2018-12-31 18:35:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9526 states. [2018-12-31 18:35:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9526 states to 9526 states and 21397 transitions. [2018-12-31 18:35:33,356 INFO L78 Accepts]: Start accepts. Automaton has 9526 states and 21397 transitions. Word has length 94 [2018-12-31 18:35:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:33,357 INFO L480 AbstractCegarLoop]: Abstraction has 9526 states and 21397 transitions. [2018-12-31 18:35:33,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9526 states and 21397 transitions. [2018-12-31 18:35:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:33,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:33,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:33,368 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1472263231, now seen corresponding path program 1 times [2018-12-31 18:35:33,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:33,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:33,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:33,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:33,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:33,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:33,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:33,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:33,512 INFO L87 Difference]: Start difference. First operand 9526 states and 21397 transitions. Second operand 5 states. [2018-12-31 18:35:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:33,986 INFO L93 Difference]: Finished difference Result 11733 states and 26116 transitions. [2018-12-31 18:35:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:35:33,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:35:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:34,002 INFO L225 Difference]: With dead ends: 11733 [2018-12-31 18:35:34,002 INFO L226 Difference]: Without dead ends: 11553 [2018-12-31 18:35:34,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2018-12-31 18:35:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 10359. [2018-12-31 18:35:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2018-12-31 18:35:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 23191 transitions. [2018-12-31 18:35:34,128 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 23191 transitions. Word has length 94 [2018-12-31 18:35:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:34,128 INFO L480 AbstractCegarLoop]: Abstraction has 10359 states and 23191 transitions. [2018-12-31 18:35:34,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 23191 transitions. [2018-12-31 18:35:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:34,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:34,141 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:34,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1759553568, now seen corresponding path program 1 times [2018-12-31 18:35:34,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:34,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:34,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:34,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:34,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:34,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:34,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:34,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:34,493 INFO L87 Difference]: Start difference. First operand 10359 states and 23191 transitions. Second operand 5 states. [2018-12-31 18:35:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:35,404 INFO L93 Difference]: Finished difference Result 13005 states and 28915 transitions. [2018-12-31 18:35:35,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:35,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:35:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:35,421 INFO L225 Difference]: With dead ends: 13005 [2018-12-31 18:35:35,421 INFO L226 Difference]: Without dead ends: 12872 [2018-12-31 18:35:35,421 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 18:35:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2018-12-31 18:35:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 10524. [2018-12-31 18:35:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10524 states. [2018-12-31 18:35:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 23529 transitions. [2018-12-31 18:35:35,556 INFO L78 Accepts]: Start accepts. Automaton has 10524 states and 23529 transitions. Word has length 94 [2018-12-31 18:35:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:35,556 INFO L480 AbstractCegarLoop]: Abstraction has 10524 states and 23529 transitions. [2018-12-31 18:35:35,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 10524 states and 23529 transitions. [2018-12-31 18:35:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:35,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:35,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:35,568 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -524449204, now seen corresponding path program 1 times [2018-12-31 18:35:35,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:35,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:35,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:35,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:35,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:35,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:35,799 INFO L87 Difference]: Start difference. First operand 10524 states and 23529 transitions. Second operand 5 states. [2018-12-31 18:35:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:35,923 INFO L93 Difference]: Finished difference Result 8563 states and 19163 transitions. [2018-12-31 18:35:35,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:35,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:35:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:35,935 INFO L225 Difference]: With dead ends: 8563 [2018-12-31 18:35:35,935 INFO L226 Difference]: Without dead ends: 8563 [2018-12-31 18:35:35,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2018-12-31 18:35:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 6968. [2018-12-31 18:35:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6968 states. [2018-12-31 18:35:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 15719 transitions. [2018-12-31 18:35:36,013 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 15719 transitions. Word has length 94 [2018-12-31 18:35:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:36,014 INFO L480 AbstractCegarLoop]: Abstraction has 6968 states and 15719 transitions. [2018-12-31 18:35:36,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 15719 transitions. [2018-12-31 18:35:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:36,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:36,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:36,021 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1201031693, now seen corresponding path program 2 times [2018-12-31 18:35:36,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:36,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:36,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:36,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:36,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:36,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:36,389 INFO L87 Difference]: Start difference. First operand 6968 states and 15719 transitions. Second operand 7 states. [2018-12-31 18:35:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:36,815 INFO L93 Difference]: Finished difference Result 8682 states and 19319 transitions. [2018-12-31 18:35:36,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:36,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 18:35:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:36,828 INFO L225 Difference]: With dead ends: 8682 [2018-12-31 18:35:36,828 INFO L226 Difference]: Without dead ends: 8682 [2018-12-31 18:35:36,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:35:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2018-12-31 18:35:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 7081. [2018-12-31 18:35:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7081 states. [2018-12-31 18:35:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15958 transitions. [2018-12-31 18:35:36,912 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15958 transitions. Word has length 94 [2018-12-31 18:35:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:36,912 INFO L480 AbstractCegarLoop]: Abstraction has 7081 states and 15958 transitions. [2018-12-31 18:35:36,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15958 transitions. [2018-12-31 18:35:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:36,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:36,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:36,920 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2030785106, now seen corresponding path program 2 times [2018-12-31 18:35:36,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:36,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:36,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:35:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:37,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:37,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:37,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:37,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:37,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:37,317 INFO L87 Difference]: Start difference. First operand 7081 states and 15958 transitions. Second operand 7 states. [2018-12-31 18:35:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:37,748 INFO L93 Difference]: Finished difference Result 9946 states and 22406 transitions. [2018-12-31 18:35:37,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:37,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 18:35:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:37,762 INFO L225 Difference]: With dead ends: 9946 [2018-12-31 18:35:37,763 INFO L226 Difference]: Without dead ends: 9914 [2018-12-31 18:35:37,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:35:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2018-12-31 18:35:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8741. [2018-12-31 18:35:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2018-12-31 18:35:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 19564 transitions. [2018-12-31 18:35:37,858 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 19564 transitions. Word has length 94 [2018-12-31 18:35:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:37,859 INFO L480 AbstractCegarLoop]: Abstraction has 8741 states and 19564 transitions. [2018-12-31 18:35:37,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 19564 transitions. [2018-12-31 18:35:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:37,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:37,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:37,869 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash 467230831, now seen corresponding path program 1 times [2018-12-31 18:35:37,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:37,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:37,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:35:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:38,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:38,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:35:38,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:35:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:35:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:38,531 INFO L87 Difference]: Start difference. First operand 8741 states and 19564 transitions. Second operand 8 states. [2018-12-31 18:35:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:39,047 INFO L93 Difference]: Finished difference Result 13745 states and 31428 transitions. [2018-12-31 18:35:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:35:39,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-31 18:35:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:39,071 INFO L225 Difference]: With dead ends: 13745 [2018-12-31 18:35:39,071 INFO L226 Difference]: Without dead ends: 13745 [2018-12-31 18:35:39,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:35:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13745 states. [2018-12-31 18:35:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13745 to 9372. [2018-12-31 18:35:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9372 states. [2018-12-31 18:35:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 21224 transitions. [2018-12-31 18:35:39,233 INFO L78 Accepts]: Start accepts. Automaton has 9372 states and 21224 transitions. Word has length 94 [2018-12-31 18:35:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:39,233 INFO L480 AbstractCegarLoop]: Abstraction has 9372 states and 21224 transitions. [2018-12-31 18:35:39,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:35:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9372 states and 21224 transitions. [2018-12-31 18:35:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:39,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:39,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:39,245 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1354734512, now seen corresponding path program 1 times [2018-12-31 18:35:39,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:39,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:39,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:39,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:39,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:39,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:39,456 INFO L87 Difference]: Start difference. First operand 9372 states and 21224 transitions. Second operand 7 states. [2018-12-31 18:35:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:39,714 INFO L93 Difference]: Finished difference Result 12354 states and 28392 transitions. [2018-12-31 18:35:39,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:39,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 18:35:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:39,732 INFO L225 Difference]: With dead ends: 12354 [2018-12-31 18:35:39,733 INFO L226 Difference]: Without dead ends: 12354 [2018-12-31 18:35:39,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:35:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2018-12-31 18:35:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 9024. [2018-12-31 18:35:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9024 states. [2018-12-31 18:35:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 20322 transitions. [2018-12-31 18:35:39,877 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 20322 transitions. Word has length 94 [2018-12-31 18:35:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:39,877 INFO L480 AbstractCegarLoop]: Abstraction has 9024 states and 20322 transitions. [2018-12-31 18:35:39,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 20322 transitions. [2018-12-31 18:35:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:39,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:39,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:39,890 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -377241040, now seen corresponding path program 1 times [2018-12-31 18:35:39,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:39,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:40,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:40,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:40,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:40,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:40,194 INFO L87 Difference]: Start difference. First operand 9024 states and 20322 transitions. Second operand 6 states. [2018-12-31 18:35:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:40,373 INFO L93 Difference]: Finished difference Result 8544 states and 18834 transitions. [2018-12-31 18:35:40,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:40,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 18:35:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:40,385 INFO L225 Difference]: With dead ends: 8544 [2018-12-31 18:35:40,386 INFO L226 Difference]: Without dead ends: 8544 [2018-12-31 18:35:40,386 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 18:35:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8544 states. [2018-12-31 18:35:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8544 to 5376. [2018-12-31 18:35:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2018-12-31 18:35:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 11789 transitions. [2018-12-31 18:35:40,468 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 11789 transitions. Word has length 94 [2018-12-31 18:35:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:40,468 INFO L480 AbstractCegarLoop]: Abstraction has 5376 states and 11789 transitions. [2018-12-31 18:35:40,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 11789 transitions. [2018-12-31 18:35:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:40,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:40,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:40,475 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:40,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:40,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2113137847, now seen corresponding path program 1 times [2018-12-31 18:35:40,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:40,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:40,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:40,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:40,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:40,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:40,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:40,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:40,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:40,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:40,596 INFO L87 Difference]: Start difference. First operand 5376 states and 11789 transitions. Second operand 6 states. [2018-12-31 18:35:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:40,818 INFO L93 Difference]: Finished difference Result 5653 states and 12339 transitions. [2018-12-31 18:35:40,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:40,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:35:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:40,828 INFO L225 Difference]: With dead ends: 5653 [2018-12-31 18:35:40,828 INFO L226 Difference]: Without dead ends: 5653 [2018-12-31 18:35:40,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2018-12-31 18:35:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 5267. [2018-12-31 18:35:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5267 states. [2018-12-31 18:35:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 11535 transitions. [2018-12-31 18:35:40,892 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 11535 transitions. Word has length 96 [2018-12-31 18:35:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:40,893 INFO L480 AbstractCegarLoop]: Abstraction has 5267 states and 11535 transitions. [2018-12-31 18:35:40,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 11535 transitions. [2018-12-31 18:35:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:40,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:40,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:40,900 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:40,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:40,900 INFO L82 PathProgramCache]: Analyzing trace with hash -990915638, now seen corresponding path program 1 times [2018-12-31 18:35:40,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:40,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:40,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:40,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:40,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:41,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 18:35:41,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:41,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:35:41,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:35:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:35:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:41,100 INFO L87 Difference]: Start difference. First operand 5267 states and 11535 transitions. Second operand 8 states. [2018-12-31 18:35:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:41,513 INFO L93 Difference]: Finished difference Result 6197 states and 13514 transitions. [2018-12-31 18:35:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:35:41,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 18:35:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:41,523 INFO L225 Difference]: With dead ends: 6197 [2018-12-31 18:35:41,523 INFO L226 Difference]: Without dead ends: 6197 [2018-12-31 18:35:41,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-31 18:35:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2018-12-31 18:35:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 6115. [2018-12-31 18:35:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6115 states. [2018-12-31 18:35:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 13345 transitions. [2018-12-31 18:35:41,593 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 13345 transitions. Word has length 96 [2018-12-31 18:35:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:41,593 INFO L480 AbstractCegarLoop]: Abstraction has 6115 states and 13345 transitions. [2018-12-31 18:35:41,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:35:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 13345 transitions. [2018-12-31 18:35:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:41,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:41,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:41,600 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash -103411957, now seen corresponding path program 1 times [2018-12-31 18:35:41,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:41,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:41,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:41,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:41,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:41,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:41,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 18:35:41,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 18:35:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 18:35:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:35:41,850 INFO L87 Difference]: Start difference. First operand 6115 states and 13345 transitions. Second operand 11 states. [2018-12-31 18:35:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:43,526 INFO L93 Difference]: Finished difference Result 11346 states and 24932 transitions. [2018-12-31 18:35:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 18:35:43,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-31 18:35:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:43,539 INFO L225 Difference]: With dead ends: 11346 [2018-12-31 18:35:43,539 INFO L226 Difference]: Without dead ends: 7294 [2018-12-31 18:35:43,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 18:35:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2018-12-31 18:35:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 5527. [2018-12-31 18:35:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5527 states. [2018-12-31 18:35:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 12042 transitions. [2018-12-31 18:35:43,617 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 12042 transitions. Word has length 96 [2018-12-31 18:35:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:43,617 INFO L480 AbstractCegarLoop]: Abstraction has 5527 states and 12042 transitions. [2018-12-31 18:35:43,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 18:35:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 12042 transitions. [2018-12-31 18:35:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:43,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:43,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:43,627 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:43,627 INFO L82 PathProgramCache]: Analyzing trace with hash 397601140, now seen corresponding path program 1 times [2018-12-31 18:35:43,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:43,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:43,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:43,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:43,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:44,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:44,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:44,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:44,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:44,216 INFO L87 Difference]: Start difference. First operand 5527 states and 12042 transitions. Second operand 6 states. [2018-12-31 18:35:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:44,764 INFO L93 Difference]: Finished difference Result 6293 states and 13733 transitions. [2018-12-31 18:35:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:44,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:35:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:44,774 INFO L225 Difference]: With dead ends: 6293 [2018-12-31 18:35:44,774 INFO L226 Difference]: Without dead ends: 6293 [2018-12-31 18:35:44,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2018-12-31 18:35:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 5700. [2018-12-31 18:35:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2018-12-31 18:35:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 12418 transitions. [2018-12-31 18:35:44,842 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 12418 transitions. Word has length 96 [2018-12-31 18:35:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:44,843 INFO L480 AbstractCegarLoop]: Abstraction has 5700 states and 12418 transitions. [2018-12-31 18:35:44,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 12418 transitions. [2018-12-31 18:35:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:44,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:44,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:44,850 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-31 18:35:44,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:44,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:44,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:44,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:35:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:35:44,944 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 18:35:45,140 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 18:35:45,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:35:45 BasicIcfg [2018-12-31 18:35:45,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 18:35:45,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 18:35:45,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 18:35:45,143 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 18:35:45,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:34:40" (3/4) ... [2018-12-31 18:35:45,149 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 18:35:45,357 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 18:35:45,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 18:35:45,362 INFO L168 Benchmark]: Toolchain (without parser) took 67615.06 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 951.3 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,370 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:35:45,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 902.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,371 INFO L168 Benchmark]: Boogie Preprocessor took 54.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:35:45,372 INFO L168 Benchmark]: RCFGBuilder took 1513.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,372 INFO L168 Benchmark]: TraceAbstraction took 64833.60 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,372 INFO L168 Benchmark]: Witness Printer took 218.07 ms. Allocated memory is still 4.5 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,378 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 902.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1513.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64833.60 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 218.07 ms. Allocated memory is still 4.5 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t311; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t312; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 64.6s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10628 SDtfs, 12601 SDslu, 24616 SDs, 0 SdLazy, 11201 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 103 SyntacticMatches, 35 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 18.9s AutomataMinimizationTime, 38 MinimizatonAttempts, 184522 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 2953 NumberOfCodeBlocks, 2953 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2819 ConstructedInterpolants, 0 QuantifiedInterpolants, 635922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...