./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread/singleton_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/singleton_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 7540c95af84ce36a44a847aa5fc0422896a0f0bd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:23:01,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 17:23:01,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 17:23:01,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 17:23:01,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 17:23:01,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 17:23:01,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 17:23:01,674 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 17:23:01,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 17:23:01,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 17:23:01,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 17:23:01,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 17:23:01,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 17:23:01,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 17:23:01,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 17:23:01,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 17:23:01,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 17:23:01,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 17:23:01,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 17:23:01,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 17:23:01,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 17:23:01,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 17:23:01,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 17:23:01,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 17:23:01,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 17:23:01,719 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 17:23:01,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 17:23:01,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 17:23:01,725 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 17:23:01,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 17:23:01,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 17:23:01,730 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 17:23:01,731 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 17:23:01,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 17:23:01,733 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 17:23:01,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 17:23:01,734 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 17:23:01,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 17:23:01,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 17:23:01,762 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 17:23:01,763 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 17:23:01,765 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 17:23:01,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 17:23:01,766 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 17:23:01,766 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 17:23:01,766 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 17:23:01,766 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 17:23:01,767 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 17:23:01,767 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 17:23:01,767 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 17:23:01,767 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 17:23:01,767 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 17:23:01,767 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 17:23:01,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 17:23:01,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 17:23:01,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 17:23:01,768 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 17:23:01,768 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 17:23:01,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 17:23:01,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 17:23:01,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 17:23:01,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 17:23:01,770 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 17:23:01,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 17:23:01,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 17:23:01,771 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 -> 7540c95af84ce36a44a847aa5fc0422896a0f0bd [2018-12-31 17:23:01,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 17:23:01,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 17:23:01,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 17:23:01,844 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 17:23:01,844 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 17:23:01,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/singleton_false-unreach-call.i [2018-12-31 17:23:01,919 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfea0c14/5b5ab6d01d1948bd886cb861ef7f9833/FLAG9b8daf103 [2018-12-31 17:23:02,485 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 17:23:02,486 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/singleton_false-unreach-call.i [2018-12-31 17:23:02,506 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfea0c14/5b5ab6d01d1948bd886cb861ef7f9833/FLAG9b8daf103 [2018-12-31 17:23:02,743 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcfea0c14/5b5ab6d01d1948bd886cb861ef7f9833 [2018-12-31 17:23:02,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 17:23:02,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 17:23:02,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 17:23:02,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 17:23:02,753 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 17:23:02,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:23:02" (1/1) ... [2018-12-31 17:23:02,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68686ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:02, skipping insertion in model container [2018-12-31 17:23:02,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:23:02" (1/1) ... [2018-12-31 17:23:02,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 17:23:02,834 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 17:23:03,358 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 17:23:03,377 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 17:23:03,540 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 17:23:03,747 INFO L195 MainTranslator]: Completed translation [2018-12-31 17:23:03,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03 WrapperNode [2018-12-31 17:23:03,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 17:23:03,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 17:23:03,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 17:23:03,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 17:23:03,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 17:23:03,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 17:23:03,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 17:23:03,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 17:23:03,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (1/1) ... [2018-12-31 17:23:03,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 17:23:03,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 17:23:03,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 17:23:03,854 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 17:23:03,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (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 17:23:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 17:23:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 17:23:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 17:23:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-31 17:23:03,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-31 17:23:03,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-31 17:23:03,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-31 17:23:03,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-31 17:23:03,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-31 17:23:03,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-31 17:23:03,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-31 17:23:03,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 17:23:03,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 17:23:03,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 17:23:03,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 17:23:03,930 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 17:23:04,565 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 17:23:04,565 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-31 17:23:04,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:23:04 BoogieIcfgContainer [2018-12-31 17:23:04,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 17:23:04,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 17:23:04,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 17:23:04,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 17:23:04,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:23:02" (1/3) ... [2018-12-31 17:23:04,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291cb990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:23:04, skipping insertion in model container [2018-12-31 17:23:04,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:23:03" (2/3) ... [2018-12-31 17:23:04,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291cb990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:23:04, skipping insertion in model container [2018-12-31 17:23:04,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:23:04" (3/3) ... [2018-12-31 17:23:04,574 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_false-unreach-call.i [2018-12-31 17:23:04,620 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,620 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,621 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,621 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,621 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,621 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,622 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,622 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,622 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,622 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,623 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,623 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,623 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,623 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,624 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,624 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,624 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,625 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,625 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,625 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,626 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,626 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,626 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,627 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,627 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,627 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,627 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,628 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,628 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,628 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,628 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,628 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,629 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,629 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,629 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,629 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,630 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,630 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,630 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,630 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,631 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,631 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,631 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,631 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,631 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,632 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,632 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,632 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,632 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,633 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,633 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,633 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,633 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,633 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,634 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,635 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,637 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,637 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,637 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,637 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,638 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,638 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,638 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,638 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,638 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,639 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,639 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,639 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,639 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,640 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,640 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,640 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,640 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,640 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,643 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,644 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,644 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,645 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,645 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,645 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,645 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,648 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,648 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,649 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,649 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:04,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:23:05,253 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 17:23:05,254 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 17:23:05,270 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 17:23:05,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 17:23:05,313 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 17:23:05,313 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 17:23:05,314 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 17:23:05,314 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 17:23:05,314 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 17:23:05,314 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 17:23:05,314 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 17:23:05,314 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 17:23:05,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 17:23:05,329 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139places, 232 transitions [2018-12-31 17:23:08,775 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47312 states. [2018-12-31 17:23:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 47312 states. [2018-12-31 17:23:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 17:23:08,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:08,791 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] [2018-12-31 17:23:08,794 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:08,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2057999791, now seen corresponding path program 1 times [2018-12-31 17:23:08,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:08,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:08,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:08,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:08,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:09,252 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 17:23:09,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:09,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 17:23:09,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 17:23:09,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 17:23:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 17:23:09,279 INFO L87 Difference]: Start difference. First operand 47312 states. Second operand 5 states. [2018-12-31 17:23:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:10,670 INFO L93 Difference]: Finished difference Result 53970 states and 232571 transitions. [2018-12-31 17:23:10,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 17:23:10,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 17:23:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:11,031 INFO L225 Difference]: With dead ends: 53970 [2018-12-31 17:23:11,031 INFO L226 Difference]: Without dead ends: 38045 [2018-12-31 17:23:11,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:23:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38045 states. [2018-12-31 17:23:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38045 to 31406. [2018-12-31 17:23:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2018-12-31 17:23:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 135820 transitions. [2018-12-31 17:23:12,888 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 135820 transitions. Word has length 31 [2018-12-31 17:23:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:12,889 INFO L480 AbstractCegarLoop]: Abstraction has 31406 states and 135820 transitions. [2018-12-31 17:23:12,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 17:23:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 135820 transitions. [2018-12-31 17:23:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 17:23:12,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:12,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:23:12,892 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 973446305, now seen corresponding path program 2 times [2018-12-31 17:23:12,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:12,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:12,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:12,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:12,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:13,233 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 17:23:13,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:13,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 17:23:13,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 17:23:13,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 17:23:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-31 17:23:13,237 INFO L87 Difference]: Start difference. First operand 31406 states and 135820 transitions. Second operand 10 states. [2018-12-31 17:23:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:15,435 INFO L93 Difference]: Finished difference Result 38063 states and 167101 transitions. [2018-12-31 17:23:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 17:23:15,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-31 17:23:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:15,634 INFO L225 Difference]: With dead ends: 38063 [2018-12-31 17:23:15,634 INFO L226 Difference]: Without dead ends: 38063 [2018-12-31 17:23:15,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 17:23:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38063 states. [2018-12-31 17:23:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38063 to 31406. [2018-12-31 17:23:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2018-12-31 17:23:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 135820 transitions. [2018-12-31 17:23:16,700 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 135820 transitions. Word has length 31 [2018-12-31 17:23:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:16,701 INFO L480 AbstractCegarLoop]: Abstraction has 31406 states and 135820 transitions. [2018-12-31 17:23:16,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 17:23:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 135820 transitions. [2018-12-31 17:23:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 17:23:16,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:16,704 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] [2018-12-31 17:23:16,704 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:16,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash -320847025, now seen corresponding path program 3 times [2018-12-31 17:23:16,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:16,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:16,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:16,948 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 17:23:16,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:16,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 17:23:16,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 17:23:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 17:23:16,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-31 17:23:16,950 INFO L87 Difference]: Start difference. First operand 31406 states and 135820 transitions. Second operand 10 states. [2018-12-31 17:23:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:18,655 INFO L93 Difference]: Finished difference Result 44676 states and 198308 transitions. [2018-12-31 17:23:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 17:23:18,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-31 17:23:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:18,957 INFO L225 Difference]: With dead ends: 44676 [2018-12-31 17:23:18,957 INFO L226 Difference]: Without dead ends: 44676 [2018-12-31 17:23:18,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-12-31 17:23:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44676 states. [2018-12-31 17:23:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44676 to 31363. [2018-12-31 17:23:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31363 states. [2018-12-31 17:23:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31363 states to 31363 states and 135747 transitions. [2018-12-31 17:23:19,934 INFO L78 Accepts]: Start accepts. Automaton has 31363 states and 135747 transitions. Word has length 31 [2018-12-31 17:23:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:19,934 INFO L480 AbstractCegarLoop]: Abstraction has 31363 states and 135747 transitions. [2018-12-31 17:23:19,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 17:23:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 31363 states and 135747 transitions. [2018-12-31 17:23:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 17:23:19,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:19,944 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] [2018-12-31 17:23:19,944 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1852887775, now seen corresponding path program 1 times [2018-12-31 17:23:19,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:19,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:19,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:19,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:19,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:20,071 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 17:23:20,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:20,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 17:23:20,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 17:23:20,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 17:23:20,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 17:23:20,073 INFO L87 Difference]: Start difference. First operand 31363 states and 135747 transitions. Second operand 5 states. [2018-12-31 17:23:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:21,570 INFO L93 Difference]: Finished difference Result 37553 states and 163554 transitions. [2018-12-31 17:23:21,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 17:23:21,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-12-31 17:23:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:21,703 INFO L225 Difference]: With dead ends: 37553 [2018-12-31 17:23:21,704 INFO L226 Difference]: Without dead ends: 37553 [2018-12-31 17:23:21,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 17:23:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37553 states. [2018-12-31 17:23:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37553 to 35090. [2018-12-31 17:23:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35090 states. [2018-12-31 17:23:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35090 states to 35090 states and 153591 transitions. [2018-12-31 17:23:22,468 INFO L78 Accepts]: Start accepts. Automaton has 35090 states and 153591 transitions. Word has length 41 [2018-12-31 17:23:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:22,469 INFO L480 AbstractCegarLoop]: Abstraction has 35090 states and 153591 transitions. [2018-12-31 17:23:22,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 17:23:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 35090 states and 153591 transitions. [2018-12-31 17:23:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 17:23:22,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:22,475 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] [2018-12-31 17:23:22,475 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash 931900819, now seen corresponding path program 2 times [2018-12-31 17:23:22,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:22,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:22,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:22,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:22,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:22,698 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 17:23:22,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:22,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 17:23:22,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 17:23:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 17:23:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 17:23:22,700 INFO L87 Difference]: Start difference. First operand 35090 states and 153591 transitions. Second operand 6 states. [2018-12-31 17:23:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:23,378 INFO L93 Difference]: Finished difference Result 74225 states and 316462 transitions. [2018-12-31 17:23:23,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 17:23:23,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-31 17:23:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:23,511 INFO L225 Difference]: With dead ends: 74225 [2018-12-31 17:23:23,511 INFO L226 Difference]: Without dead ends: 46038 [2018-12-31 17:23:23,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-31 17:23:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46038 states. [2018-12-31 17:23:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46038 to 35487. [2018-12-31 17:23:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35487 states. [2018-12-31 17:23:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35487 states to 35487 states and 149277 transitions. [2018-12-31 17:23:28,100 INFO L78 Accepts]: Start accepts. Automaton has 35487 states and 149277 transitions. Word has length 41 [2018-12-31 17:23:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:28,100 INFO L480 AbstractCegarLoop]: Abstraction has 35487 states and 149277 transitions. [2018-12-31 17:23:28,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 17:23:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 35487 states and 149277 transitions. [2018-12-31 17:23:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 17:23:28,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:28,117 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] [2018-12-31 17:23:28,117 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:28,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2024466476, now seen corresponding path program 1 times [2018-12-31 17:23:28,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:28,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:28,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:28,335 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 17:23:28,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:28,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 17:23:28,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 17:23:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 17:23:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:23:28,336 INFO L87 Difference]: Start difference. First operand 35487 states and 149277 transitions. Second operand 7 states. [2018-12-31 17:23:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:28,939 INFO L93 Difference]: Finished difference Result 42305 states and 178055 transitions. [2018-12-31 17:23:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 17:23:28,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-31 17:23:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:29,051 INFO L225 Difference]: With dead ends: 42305 [2018-12-31 17:23:29,051 INFO L226 Difference]: Without dead ends: 42233 [2018-12-31 17:23:29,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-31 17:23:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42233 states. [2018-12-31 17:23:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42233 to 35466. [2018-12-31 17:23:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2018-12-31 17:23:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 149245 transitions. [2018-12-31 17:23:29,841 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 149245 transitions. Word has length 43 [2018-12-31 17:23:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:29,841 INFO L480 AbstractCegarLoop]: Abstraction has 35466 states and 149245 transitions. [2018-12-31 17:23:29,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 17:23:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 149245 transitions. [2018-12-31 17:23:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 17:23:29,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:29,854 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] [2018-12-31 17:23:29,854 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:29,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:29,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1156791892, now seen corresponding path program 2 times [2018-12-31 17:23:29,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:29,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:29,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:29,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:29,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:30,001 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 17:23:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 17:23:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 17:23:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 17:23:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 17:23:30,003 INFO L87 Difference]: Start difference. First operand 35466 states and 149245 transitions. Second operand 10 states. [2018-12-31 17:23:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:31,488 INFO L93 Difference]: Finished difference Result 49948 states and 204487 transitions. [2018-12-31 17:23:31,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 17:23:31,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-31 17:23:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:31,606 INFO L225 Difference]: With dead ends: 49948 [2018-12-31 17:23:31,606 INFO L226 Difference]: Without dead ends: 45132 [2018-12-31 17:23:31,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-12-31 17:23:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45132 states. [2018-12-31 17:23:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45132 to 35381. [2018-12-31 17:23:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35381 states. [2018-12-31 17:23:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 148987 transitions. [2018-12-31 17:23:32,339 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 148987 transitions. Word has length 43 [2018-12-31 17:23:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:32,339 INFO L480 AbstractCegarLoop]: Abstraction has 35381 states and 148987 transitions. [2018-12-31 17:23:32,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 17:23:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 148987 transitions. [2018-12-31 17:23:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 17:23:32,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:32,353 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] [2018-12-31 17:23:32,354 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:32,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:32,354 INFO L82 PathProgramCache]: Analyzing trace with hash 819464228, now seen corresponding path program 1 times [2018-12-31 17:23:32,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:32,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:32,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:32,593 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 17:23:32,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:32,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 17:23:32,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 17:23:32,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 17:23:32,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 17:23:32,595 INFO L87 Difference]: Start difference. First operand 35381 states and 148987 transitions. Second operand 5 states. [2018-12-31 17:23:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:33,008 INFO L93 Difference]: Finished difference Result 41392 states and 173197 transitions. [2018-12-31 17:23:33,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 17:23:33,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-31 17:23:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:33,116 INFO L225 Difference]: With dead ends: 41392 [2018-12-31 17:23:33,116 INFO L226 Difference]: Without dead ends: 40912 [2018-12-31 17:23:33,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:23:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40912 states. [2018-12-31 17:23:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40912 to 38964. [2018-12-31 17:23:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38964 states. [2018-12-31 17:23:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38964 states to 38964 states and 164377 transitions. [2018-12-31 17:23:33,860 INFO L78 Accepts]: Start accepts. Automaton has 38964 states and 164377 transitions. Word has length 44 [2018-12-31 17:23:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:33,860 INFO L480 AbstractCegarLoop]: Abstraction has 38964 states and 164377 transitions. [2018-12-31 17:23:33,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 17:23:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 38964 states and 164377 transitions. [2018-12-31 17:23:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 17:23:33,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:33,875 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] [2018-12-31 17:23:33,875 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:33,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:33,875 INFO L82 PathProgramCache]: Analyzing trace with hash 868178546, now seen corresponding path program 2 times [2018-12-31 17:23:33,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:33,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:33,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:33,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:34,025 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 17:23:34,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:34,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 17:23:34,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 17:23:34,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 17:23:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:23:34,027 INFO L87 Difference]: Start difference. First operand 38964 states and 164377 transitions. Second operand 7 states. [2018-12-31 17:23:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:34,639 INFO L93 Difference]: Finished difference Result 41851 states and 174247 transitions. [2018-12-31 17:23:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 17:23:34,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-31 17:23:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:34,766 INFO L225 Difference]: With dead ends: 41851 [2018-12-31 17:23:34,766 INFO L226 Difference]: Without dead ends: 41371 [2018-12-31 17:23:34,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-31 17:23:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41371 states. [2018-12-31 17:23:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41371 to 36092. [2018-12-31 17:23:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2018-12-31 17:23:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 150963 transitions. [2018-12-31 17:23:36,029 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 150963 transitions. Word has length 44 [2018-12-31 17:23:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:36,030 INFO L480 AbstractCegarLoop]: Abstraction has 36092 states and 150963 transitions. [2018-12-31 17:23:36,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 17:23:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 150963 transitions. [2018-12-31 17:23:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 17:23:36,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:36,043 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] [2018-12-31 17:23:36,043 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash -108546428, now seen corresponding path program 3 times [2018-12-31 17:23:36,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:36,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:36,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:36,557 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-12-31 17:23:37,023 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 17:23:37,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:37,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-31 17:23:37,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 17:23:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 17:23:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-31 17:23:37,025 INFO L87 Difference]: Start difference. First operand 36092 states and 150963 transitions. Second operand 17 states. [2018-12-31 17:23:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:38,353 INFO L93 Difference]: Finished difference Result 42947 states and 180286 transitions. [2018-12-31 17:23:38,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 17:23:38,354 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-31 17:23:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:38,467 INFO L225 Difference]: With dead ends: 42947 [2018-12-31 17:23:38,467 INFO L226 Difference]: Without dead ends: 42701 [2018-12-31 17:23:38,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-12-31 17:23:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42701 states. [2018-12-31 17:23:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42701 to 39077. [2018-12-31 17:23:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39077 states. [2018-12-31 17:23:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39077 states to 39077 states and 165463 transitions. [2018-12-31 17:23:39,323 INFO L78 Accepts]: Start accepts. Automaton has 39077 states and 165463 transitions. Word has length 44 [2018-12-31 17:23:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:39,325 INFO L480 AbstractCegarLoop]: Abstraction has 39077 states and 165463 transitions. [2018-12-31 17:23:39,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 17:23:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 39077 states and 165463 transitions. [2018-12-31 17:23:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 17:23:39,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:39,340 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] [2018-12-31 17:23:39,340 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1310405846, now seen corresponding path program 4 times [2018-12-31 17:23:39,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:39,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:39,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:39,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:39,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:39,739 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-12-31 17:23:39,947 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 17:23:39,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:39,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-31 17:23:39,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 17:23:39,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 17:23:39,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-31 17:23:39,949 INFO L87 Difference]: Start difference. First operand 39077 states and 165463 transitions. Second operand 14 states. [2018-12-31 17:23:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:41,547 INFO L93 Difference]: Finished difference Result 52363 states and 221974 transitions. [2018-12-31 17:23:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 17:23:41,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-12-31 17:23:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:41,691 INFO L225 Difference]: With dead ends: 52363 [2018-12-31 17:23:41,691 INFO L226 Difference]: Without dead ends: 52117 [2018-12-31 17:23:41,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-12-31 17:23:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52117 states. [2018-12-31 17:23:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52117 to 39004. [2018-12-31 17:23:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39004 states. [2018-12-31 17:23:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39004 states to 39004 states and 165236 transitions. [2018-12-31 17:23:42,526 INFO L78 Accepts]: Start accepts. Automaton has 39004 states and 165236 transitions. Word has length 44 [2018-12-31 17:23:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:42,527 INFO L480 AbstractCegarLoop]: Abstraction has 39004 states and 165236 transitions. [2018-12-31 17:23:42,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 17:23:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 39004 states and 165236 transitions. [2018-12-31 17:23:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 17:23:42,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:42,547 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 17:23:42,547 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1031346498, now seen corresponding path program 1 times [2018-12-31 17:23:42,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:42,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:42,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:42,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:42,742 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 17:23:42,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:42,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 17:23:42,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 17:23:42,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 17:23:42,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-31 17:23:42,744 INFO L87 Difference]: Start difference. First operand 39004 states and 165236 transitions. Second operand 12 states. [2018-12-31 17:23:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:43,593 INFO L93 Difference]: Finished difference Result 55509 states and 228067 transitions. [2018-12-31 17:23:43,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 17:23:43,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-31 17:23:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:43,721 INFO L225 Difference]: With dead ends: 55509 [2018-12-31 17:23:43,721 INFO L226 Difference]: Without dead ends: 48865 [2018-12-31 17:23:43,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2018-12-31 17:23:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48865 states. [2018-12-31 17:23:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48865 to 38732. [2018-12-31 17:23:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38732 states. [2018-12-31 17:23:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38732 states to 38732 states and 164174 transitions. [2018-12-31 17:23:44,542 INFO L78 Accepts]: Start accepts. Automaton has 38732 states and 164174 transitions. Word has length 46 [2018-12-31 17:23:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:44,542 INFO L480 AbstractCegarLoop]: Abstraction has 38732 states and 164174 transitions. [2018-12-31 17:23:44,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 17:23:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38732 states and 164174 transitions. [2018-12-31 17:23:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 17:23:44,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:44,561 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 17:23:44,561 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash -165686462, now seen corresponding path program 1 times [2018-12-31 17:23:44,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:44,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:44,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:44,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:44,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:45,214 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 17:23:45,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:45,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-31 17:23:45,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 17:23:45,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 17:23:45,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-31 17:23:45,215 INFO L87 Difference]: Start difference. First operand 38732 states and 164174 transitions. Second operand 16 states. [2018-12-31 17:23:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:46,488 INFO L93 Difference]: Finished difference Result 47685 states and 201782 transitions. [2018-12-31 17:23:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 17:23:46,489 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-31 17:23:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:46,616 INFO L225 Difference]: With dead ends: 47685 [2018-12-31 17:23:46,617 INFO L226 Difference]: Without dead ends: 47379 [2018-12-31 17:23:46,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2018-12-31 17:23:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47379 states. [2018-12-31 17:23:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47379 to 40772. [2018-12-31 17:23:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40772 states. [2018-12-31 17:23:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40772 states to 40772 states and 173863 transitions. [2018-12-31 17:23:48,391 INFO L78 Accepts]: Start accepts. Automaton has 40772 states and 173863 transitions. Word has length 46 [2018-12-31 17:23:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:48,391 INFO L480 AbstractCegarLoop]: Abstraction has 40772 states and 173863 transitions. [2018-12-31 17:23:48,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 17:23:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 40772 states and 173863 transitions. [2018-12-31 17:23:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 17:23:48,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:48,416 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 17:23:48,416 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash 299199095, now seen corresponding path program 1 times [2018-12-31 17:23:48,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:48,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:48,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:49,103 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-31 17:23:49,601 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-31 17:23:50,155 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 17:23:50,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:50,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-31 17:23:50,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 17:23:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 17:23:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-12-31 17:23:50,157 INFO L87 Difference]: Start difference. First operand 40772 states and 173863 transitions. Second operand 16 states. [2018-12-31 17:23:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:51,468 INFO L93 Difference]: Finished difference Result 49321 states and 207286 transitions. [2018-12-31 17:23:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 17:23:51,469 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-31 17:23:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:51,602 INFO L225 Difference]: With dead ends: 49321 [2018-12-31 17:23:51,602 INFO L226 Difference]: Without dead ends: 49015 [2018-12-31 17:23:51,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2018-12-31 17:23:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49015 states. [2018-12-31 17:23:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49015 to 38645. [2018-12-31 17:23:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38645 states. [2018-12-31 17:23:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38645 states to 38645 states and 163925 transitions. [2018-12-31 17:23:52,424 INFO L78 Accepts]: Start accepts. Automaton has 38645 states and 163925 transitions. Word has length 46 [2018-12-31 17:23:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:52,424 INFO L480 AbstractCegarLoop]: Abstraction has 38645 states and 163925 transitions. [2018-12-31 17:23:52,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 17:23:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 38645 states and 163925 transitions. [2018-12-31 17:23:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 17:23:52,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:52,443 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 17:23:52,443 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1385009275, now seen corresponding path program 1 times [2018-12-31 17:23:52,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:52,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:52,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:53,353 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 17:23:53,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:53,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:23:53,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:23:53,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:23:53,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:23:53,355 INFO L87 Difference]: Start difference. First operand 38645 states and 163925 transitions. Second operand 18 states. [2018-12-31 17:23:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:55,490 INFO L93 Difference]: Finished difference Result 48234 states and 205456 transitions. [2018-12-31 17:23:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 17:23:55,492 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-12-31 17:23:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:55,607 INFO L225 Difference]: With dead ends: 48234 [2018-12-31 17:23:55,607 INFO L226 Difference]: Without dead ends: 47988 [2018-12-31 17:23:55,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-12-31 17:23:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47988 states. [2018-12-31 17:23:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47988 to 37705. [2018-12-31 17:23:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37705 states. [2018-12-31 17:23:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37705 states to 37705 states and 160287 transitions. [2018-12-31 17:23:56,462 INFO L78 Accepts]: Start accepts. Automaton has 37705 states and 160287 transitions. Word has length 46 [2018-12-31 17:23:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:56,462 INFO L480 AbstractCegarLoop]: Abstraction has 37705 states and 160287 transitions. [2018-12-31 17:23:56,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:23:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 37705 states and 160287 transitions. [2018-12-31 17:23:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 17:23:56,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:56,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:23:56,485 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 620423234, now seen corresponding path program 2 times [2018-12-31 17:23:56,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:56,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:56,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:56,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:23:56,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:56,678 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 17:23:56,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:56,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 17:23:56,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 17:23:56,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 17:23:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-31 17:23:56,679 INFO L87 Difference]: Start difference. First operand 37705 states and 160287 transitions. Second operand 10 states. [2018-12-31 17:23:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:23:57,276 INFO L93 Difference]: Finished difference Result 51730 states and 218578 transitions. [2018-12-31 17:23:57,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 17:23:57,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-12-31 17:23:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:23:57,419 INFO L225 Difference]: With dead ends: 51730 [2018-12-31 17:23:57,419 INFO L226 Difference]: Without dead ends: 51424 [2018-12-31 17:23:57,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:23:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51424 states. [2018-12-31 17:23:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51424 to 37547. [2018-12-31 17:23:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37547 states. [2018-12-31 17:23:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37547 states to 37547 states and 159872 transitions. [2018-12-31 17:23:58,738 INFO L78 Accepts]: Start accepts. Automaton has 37547 states and 159872 transitions. Word has length 46 [2018-12-31 17:23:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:23:58,738 INFO L480 AbstractCegarLoop]: Abstraction has 37547 states and 159872 transitions. [2018-12-31 17:23:58,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 17:23:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37547 states and 159872 transitions. [2018-12-31 17:23:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 17:23:58,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:23:58,760 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] [2018-12-31 17:23:58,760 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:23:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:23:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2011508605, now seen corresponding path program 1 times [2018-12-31 17:23:58,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:23:58,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:23:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:58,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:23:58,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:23:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:23:59,290 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-31 17:23:59,705 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 17:23:59,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:23:59,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-31 17:23:59,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 17:23:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 17:23:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-12-31 17:23:59,707 INFO L87 Difference]: Start difference. First operand 37547 states and 159872 transitions. Second operand 19 states. [2018-12-31 17:24:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:01,740 INFO L93 Difference]: Finished difference Result 42943 states and 180662 transitions. [2018-12-31 17:24:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 17:24:01,742 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-31 17:24:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:01,843 INFO L225 Difference]: With dead ends: 42943 [2018-12-31 17:24:01,843 INFO L226 Difference]: Without dead ends: 42637 [2018-12-31 17:24:01,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-12-31 17:24:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42637 states. [2018-12-31 17:24:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42637 to 34160. [2018-12-31 17:24:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2018-12-31 17:24:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 144012 transitions. [2018-12-31 17:24:02,561 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 144012 transitions. Word has length 48 [2018-12-31 17:24:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:02,562 INFO L480 AbstractCegarLoop]: Abstraction has 34160 states and 144012 transitions. [2018-12-31 17:24:02,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 17:24:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 144012 transitions. [2018-12-31 17:24:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 17:24:02,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:02,585 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 17:24:02,585 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1891753118, now seen corresponding path program 1 times [2018-12-31 17:24:02,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:02,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:02,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:02,873 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 17:24:02,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:02,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 17:24:02,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 17:24:02,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 17:24:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 17:24:02,875 INFO L87 Difference]: Start difference. First operand 34160 states and 144012 transitions. Second operand 5 states. [2018-12-31 17:24:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:03,179 INFO L93 Difference]: Finished difference Result 38901 states and 161890 transitions. [2018-12-31 17:24:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 17:24:03,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-31 17:24:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:03,281 INFO L225 Difference]: With dead ends: 38901 [2018-12-31 17:24:03,281 INFO L226 Difference]: Without dead ends: 38067 [2018-12-31 17:24:03,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:24:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38067 states. [2018-12-31 17:24:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38067 to 36249. [2018-12-31 17:24:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36249 states. [2018-12-31 17:24:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36249 states to 36249 states and 152432 transitions. [2018-12-31 17:24:03,995 INFO L78 Accepts]: Start accepts. Automaton has 36249 states and 152432 transitions. Word has length 49 [2018-12-31 17:24:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:03,995 INFO L480 AbstractCegarLoop]: Abstraction has 36249 states and 152432 transitions. [2018-12-31 17:24:03,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 17:24:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 36249 states and 152432 transitions. [2018-12-31 17:24:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 17:24:04,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:04,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:04,027 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1732785392, now seen corresponding path program 2 times [2018-12-31 17:24:04,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:04,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:24:04,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:04,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 17:24:04,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 17:24:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 17:24:04,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:24:04,247 INFO L87 Difference]: Start difference. First operand 36249 states and 152432 transitions. Second operand 7 states. [2018-12-31 17:24:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:04,836 INFO L93 Difference]: Finished difference Result 40969 states and 170278 transitions. [2018-12-31 17:24:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 17:24:04,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-31 17:24:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:04,941 INFO L225 Difference]: With dead ends: 40969 [2018-12-31 17:24:04,941 INFO L226 Difference]: Without dead ends: 40135 [2018-12-31 17:24:04,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-31 17:24:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40135 states. [2018-12-31 17:24:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40135 to 36228. [2018-12-31 17:24:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36228 states. [2018-12-31 17:24:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36228 states to 36228 states and 152400 transitions. [2018-12-31 17:24:05,718 INFO L78 Accepts]: Start accepts. Automaton has 36228 states and 152400 transitions. Word has length 49 [2018-12-31 17:24:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:05,719 INFO L480 AbstractCegarLoop]: Abstraction has 36228 states and 152400 transitions. [2018-12-31 17:24:05,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 17:24:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 36228 states and 152400 transitions. [2018-12-31 17:24:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 17:24:05,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:05,750 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 17:24:05,750 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1459685517, now seen corresponding path program 1 times [2018-12-31 17:24:05,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:05,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:06,075 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-31 17:24:06,418 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-31 17:24:07,429 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 17:24:07,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:07,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-31 17:24:07,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 17:24:07,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 17:24:07,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-12-31 17:24:07,431 INFO L87 Difference]: Start difference. First operand 36228 states and 152400 transitions. Second operand 20 states. [2018-12-31 17:24:08,525 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-12-31 17:24:08,669 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-12-31 17:24:08,849 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-12-31 17:24:08,993 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2018-12-31 17:24:09,865 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-31 17:24:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:10,894 INFO L93 Difference]: Finished difference Result 38154 states and 158626 transitions. [2018-12-31 17:24:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-31 17:24:10,895 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-12-31 17:24:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:10,994 INFO L225 Difference]: With dead ends: 38154 [2018-12-31 17:24:10,994 INFO L226 Difference]: Without dead ends: 37938 [2018-12-31 17:24:10,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=319, Invalid=1163, Unknown=0, NotChecked=0, Total=1482 [2018-12-31 17:24:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37938 states. [2018-12-31 17:24:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37938 to 31880. [2018-12-31 17:24:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31880 states. [2018-12-31 17:24:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31880 states to 31880 states and 132794 transitions. [2018-12-31 17:24:11,666 INFO L78 Accepts]: Start accepts. Automaton has 31880 states and 132794 transitions. Word has length 49 [2018-12-31 17:24:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:11,667 INFO L480 AbstractCegarLoop]: Abstraction has 31880 states and 132794 transitions. [2018-12-31 17:24:11,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 17:24:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31880 states and 132794 transitions. [2018-12-31 17:24:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 17:24:11,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:11,690 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 17:24:11,690 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:11,690 INFO L82 PathProgramCache]: Analyzing trace with hash -114085722, now seen corresponding path program 1 times [2018-12-31 17:24:11,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:11,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:11,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:13,008 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 17:24:13,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:13,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-31 17:24:13,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 17:24:13,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 17:24:13,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-12-31 17:24:13,009 INFO L87 Difference]: Start difference. First operand 31880 states and 132794 transitions. Second operand 20 states. [2018-12-31 17:24:13,439 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-31 17:24:14,028 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2018-12-31 17:24:14,188 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-12-31 17:24:14,366 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-12-31 17:24:14,533 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2018-12-31 17:24:14,752 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2018-12-31 17:24:15,758 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-12-31 17:24:15,882 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-12-31 17:24:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:16,649 INFO L93 Difference]: Finished difference Result 34540 states and 142264 transitions. [2018-12-31 17:24:16,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-31 17:24:16,651 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-12-31 17:24:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:16,737 INFO L225 Difference]: With dead ends: 34540 [2018-12-31 17:24:16,737 INFO L226 Difference]: Without dead ends: 33100 [2018-12-31 17:24:16,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2018-12-31 17:24:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33100 states. [2018-12-31 17:24:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33100 to 23509. [2018-12-31 17:24:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23509 states. [2018-12-31 17:24:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23509 states to 23509 states and 96496 transitions. [2018-12-31 17:24:17,247 INFO L78 Accepts]: Start accepts. Automaton has 23509 states and 96496 transitions. Word has length 49 [2018-12-31 17:24:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:17,248 INFO L480 AbstractCegarLoop]: Abstraction has 23509 states and 96496 transitions. [2018-12-31 17:24:17,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 17:24:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 23509 states and 96496 transitions. [2018-12-31 17:24:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 17:24:17,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:17,266 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 17:24:17,266 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:17,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash -672953966, now seen corresponding path program 3 times [2018-12-31 17:24:17,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:17,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:17,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:17,702 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 17:24:17,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:17,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-31 17:24:17,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 17:24:17,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 17:24:17,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-31 17:24:17,704 INFO L87 Difference]: Start difference. First operand 23509 states and 96496 transitions. Second operand 16 states. [2018-12-31 17:24:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:18,352 INFO L93 Difference]: Finished difference Result 28138 states and 114119 transitions. [2018-12-31 17:24:18,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 17:24:18,353 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-31 17:24:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:18,423 INFO L225 Difference]: With dead ends: 28138 [2018-12-31 17:24:18,423 INFO L226 Difference]: Without dead ends: 27349 [2018-12-31 17:24:18,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-12-31 17:24:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27349 states. [2018-12-31 17:24:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27349 to 23509. [2018-12-31 17:24:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23509 states. [2018-12-31 17:24:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23509 states to 23509 states and 96496 transitions. [2018-12-31 17:24:18,870 INFO L78 Accepts]: Start accepts. Automaton has 23509 states and 96496 transitions. Word has length 49 [2018-12-31 17:24:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:18,870 INFO L480 AbstractCegarLoop]: Abstraction has 23509 states and 96496 transitions. [2018-12-31 17:24:18,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 17:24:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 23509 states and 96496 transitions. [2018-12-31 17:24:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 17:24:18,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:18,886 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 17:24:18,887 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1155264282, now seen corresponding path program 4 times [2018-12-31 17:24:18,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:18,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:18,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:19,730 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-31 17:24:20,179 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 17:24:20,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:20,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-31 17:24:20,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 17:24:20,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 17:24:20,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-12-31 17:24:20,180 INFO L87 Difference]: Start difference. First operand 23509 states and 96496 transitions. Second operand 19 states. [2018-12-31 17:24:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:21,276 INFO L93 Difference]: Finished difference Result 29908 states and 121294 transitions. [2018-12-31 17:24:21,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 17:24:21,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-31 17:24:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:21,351 INFO L225 Difference]: With dead ends: 29908 [2018-12-31 17:24:21,352 INFO L226 Difference]: Without dead ends: 29119 [2018-12-31 17:24:21,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-12-31 17:24:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29119 states. [2018-12-31 17:24:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29119 to 23329. [2018-12-31 17:24:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23329 states. [2018-12-31 17:24:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23329 states to 23329 states and 95602 transitions. [2018-12-31 17:24:22,088 INFO L78 Accepts]: Start accepts. Automaton has 23329 states and 95602 transitions. Word has length 49 [2018-12-31 17:24:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:22,089 INFO L480 AbstractCegarLoop]: Abstraction has 23329 states and 95602 transitions. [2018-12-31 17:24:22,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 17:24:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 23329 states and 95602 transitions. [2018-12-31 17:24:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 17:24:22,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:22,105 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 17:24:22,105 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:22,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1728037470, now seen corresponding path program 5 times [2018-12-31 17:24:22,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:22,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:22,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:22,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:22,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:22,661 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 17:24:22,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:22,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-31 17:24:22,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 17:24:22,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 17:24:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-31 17:24:22,662 INFO L87 Difference]: Start difference. First operand 23329 states and 95602 transitions. Second operand 16 states. [2018-12-31 17:24:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:23,608 INFO L93 Difference]: Finished difference Result 33290 states and 134192 transitions. [2018-12-31 17:24:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 17:24:23,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-31 17:24:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:23,695 INFO L225 Difference]: With dead ends: 33290 [2018-12-31 17:24:23,696 INFO L226 Difference]: Without dead ends: 32456 [2018-12-31 17:24:23,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-12-31 17:24:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32456 states. [2018-12-31 17:24:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32456 to 23122. [2018-12-31 17:24:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23122 states. [2018-12-31 17:24:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23122 states to 23122 states and 94845 transitions. [2018-12-31 17:24:24,195 INFO L78 Accepts]: Start accepts. Automaton has 23122 states and 94845 transitions. Word has length 49 [2018-12-31 17:24:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:24,195 INFO L480 AbstractCegarLoop]: Abstraction has 23122 states and 94845 transitions. [2018-12-31 17:24:24,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 17:24:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 23122 states and 94845 transitions. [2018-12-31 17:24:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 17:24:24,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:24,214 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 17:24:24,214 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2105891278, now seen corresponding path program 1 times [2018-12-31 17:24:24,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:24,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:24,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:24,525 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 17:24:24,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:24,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 17:24:24,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 17:24:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 17:24:24,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 17:24:24,526 INFO L87 Difference]: Start difference. First operand 23122 states and 94845 transitions. Second operand 10 states. [2018-12-31 17:24:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:25,326 INFO L93 Difference]: Finished difference Result 33206 states and 132204 transitions. [2018-12-31 17:24:25,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 17:24:25,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-12-31 17:24:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:25,392 INFO L225 Difference]: With dead ends: 33206 [2018-12-31 17:24:25,392 INFO L226 Difference]: Without dead ends: 26143 [2018-12-31 17:24:25,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-12-31 17:24:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26143 states. [2018-12-31 17:24:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26143 to 20399. [2018-12-31 17:24:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20399 states. [2018-12-31 17:24:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20399 states to 20399 states and 83215 transitions. [2018-12-31 17:24:25,850 INFO L78 Accepts]: Start accepts. Automaton has 20399 states and 83215 transitions. Word has length 49 [2018-12-31 17:24:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:25,850 INFO L480 AbstractCegarLoop]: Abstraction has 20399 states and 83215 transitions. [2018-12-31 17:24:25,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 17:24:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 20399 states and 83215 transitions. [2018-12-31 17:24:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 17:24:25,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:25,871 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] [2018-12-31 17:24:25,871 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1659149151, now seen corresponding path program 1 times [2018-12-31 17:24:25,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:25,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:25,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:25,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:25,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:26,604 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 17:24:26,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:26,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:24:26,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:24:26,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:24:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:24:26,605 INFO L87 Difference]: Start difference. First operand 20399 states and 83215 transitions. Second operand 18 states. [2018-12-31 17:24:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:27,945 INFO L93 Difference]: Finished difference Result 27038 states and 108725 transitions. [2018-12-31 17:24:27,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-31 17:24:27,954 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-12-31 17:24:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:28,023 INFO L225 Difference]: With dead ends: 27038 [2018-12-31 17:24:28,023 INFO L226 Difference]: Without dead ends: 26669 [2018-12-31 17:24:28,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2018-12-31 17:24:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26669 states. [2018-12-31 17:24:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26669 to 20090. [2018-12-31 17:24:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20090 states. [2018-12-31 17:24:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 82205 transitions. [2018-12-31 17:24:28,436 INFO L78 Accepts]: Start accepts. Automaton has 20090 states and 82205 transitions. Word has length 51 [2018-12-31 17:24:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:28,436 INFO L480 AbstractCegarLoop]: Abstraction has 20090 states and 82205 transitions. [2018-12-31 17:24:28,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:24:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 20090 states and 82205 transitions. [2018-12-31 17:24:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 17:24:28,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:28,454 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] [2018-12-31 17:24:28,454 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1841104979, now seen corresponding path program 1 times [2018-12-31 17:24:28,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:28,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:28,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:29,348 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 17:24:29,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:29,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:24:29,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:24:29,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:24:29,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:24:29,350 INFO L87 Difference]: Start difference. First operand 20090 states and 82205 transitions. Second operand 18 states. [2018-12-31 17:24:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:30,676 INFO L93 Difference]: Finished difference Result 26099 states and 105749 transitions. [2018-12-31 17:24:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 17:24:30,677 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-12-31 17:24:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:30,740 INFO L225 Difference]: With dead ends: 26099 [2018-12-31 17:24:30,740 INFO L226 Difference]: Without dead ends: 25550 [2018-12-31 17:24:30,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-12-31 17:24:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25550 states. [2018-12-31 17:24:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25550 to 20034. [2018-12-31 17:24:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20034 states. [2018-12-31 17:24:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 81977 transitions. [2018-12-31 17:24:31,180 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 81977 transitions. Word has length 51 [2018-12-31 17:24:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:31,180 INFO L480 AbstractCegarLoop]: Abstraction has 20034 states and 81977 transitions. [2018-12-31 17:24:31,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:24:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 81977 transitions. [2018-12-31 17:24:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 17:24:31,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:31,199 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] [2018-12-31 17:24:31,200 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:31,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:31,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1358794663, now seen corresponding path program 2 times [2018-12-31 17:24:31,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:31,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:32,665 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 17:24:32,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:32,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-31 17:24:32,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 17:24:32,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 17:24:32,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-12-31 17:24:32,666 INFO L87 Difference]: Start difference. First operand 20034 states and 81977 transitions. Second operand 21 states. [2018-12-31 17:24:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:34,399 INFO L93 Difference]: Finished difference Result 20248 states and 81696 transitions. [2018-12-31 17:24:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 17:24:34,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-31 17:24:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:34,448 INFO L225 Difference]: With dead ends: 20248 [2018-12-31 17:24:34,448 INFO L226 Difference]: Without dead ends: 18421 [2018-12-31 17:24:34,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 17:24:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2018-12-31 17:24:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 12961. [2018-12-31 17:24:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12961 states. [2018-12-31 17:24:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 52686 transitions. [2018-12-31 17:24:34,719 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 52686 transitions. Word has length 51 [2018-12-31 17:24:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:34,719 INFO L480 AbstractCegarLoop]: Abstraction has 12961 states and 52686 transitions. [2018-12-31 17:24:34,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 17:24:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 52686 transitions. [2018-12-31 17:24:34,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 17:24:34,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:34,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:34,732 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash 66214973, now seen corresponding path program 1 times [2018-12-31 17:24:34,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:34,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:34,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:34,861 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 17:24:34,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:34,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 17:24:34,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 17:24:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 17:24:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 17:24:34,863 INFO L87 Difference]: Start difference. First operand 12961 states and 52686 transitions. Second operand 5 states. [2018-12-31 17:24:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:35,030 INFO L93 Difference]: Finished difference Result 15974 states and 63017 transitions. [2018-12-31 17:24:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 17:24:35,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-31 17:24:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:35,069 INFO L225 Difference]: With dead ends: 15974 [2018-12-31 17:24:35,070 INFO L226 Difference]: Without dead ends: 15254 [2018-12-31 17:24:35,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 17:24:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15254 states. [2018-12-31 17:24:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15254 to 14834. [2018-12-31 17:24:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14834 states. [2018-12-31 17:24:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14834 states to 14834 states and 59420 transitions. [2018-12-31 17:24:35,321 INFO L78 Accepts]: Start accepts. Automaton has 14834 states and 59420 transitions. Word has length 52 [2018-12-31 17:24:35,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:35,321 INFO L480 AbstractCegarLoop]: Abstraction has 14834 states and 59420 transitions. [2018-12-31 17:24:35,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 17:24:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 14834 states and 59420 transitions. [2018-12-31 17:24:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 17:24:35,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:35,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:35,335 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1212252299, now seen corresponding path program 2 times [2018-12-31 17:24:35,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:35,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:35,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:35,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:35,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:35,443 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 17:24:35,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:35,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 17:24:35,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 17:24:35,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 17:24:35,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 17:24:35,444 INFO L87 Difference]: Start difference. First operand 14834 states and 59420 transitions. Second operand 7 states. [2018-12-31 17:24:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:35,888 INFO L93 Difference]: Finished difference Result 17826 states and 69719 transitions. [2018-12-31 17:24:35,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 17:24:35,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-31 17:24:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:35,926 INFO L225 Difference]: With dead ends: 17826 [2018-12-31 17:24:35,926 INFO L226 Difference]: Without dead ends: 17106 [2018-12-31 17:24:35,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-31 17:24:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2018-12-31 17:24:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 14813. [2018-12-31 17:24:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14813 states. [2018-12-31 17:24:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14813 states to 14813 states and 59388 transitions. [2018-12-31 17:24:36,193 INFO L78 Accepts]: Start accepts. Automaton has 14813 states and 59388 transitions. Word has length 52 [2018-12-31 17:24:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:36,193 INFO L480 AbstractCegarLoop]: Abstraction has 14813 states and 59388 transitions. [2018-12-31 17:24:36,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 17:24:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 14813 states and 59388 transitions. [2018-12-31 17:24:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 17:24:36,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:36,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:36,208 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:36,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash -602885373, now seen corresponding path program 3 times [2018-12-31 17:24:36,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:36,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:36,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:36,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:36,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:36,986 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 17:24:36,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:36,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-31 17:24:36,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 17:24:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 17:24:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-12-31 17:24:36,987 INFO L87 Difference]: Start difference. First operand 14813 states and 59388 transitions. Second operand 21 states. [2018-12-31 17:24:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:38,465 INFO L93 Difference]: Finished difference Result 17609 states and 69125 transitions. [2018-12-31 17:24:38,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 17:24:38,467 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-31 17:24:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:38,501 INFO L225 Difference]: With dead ends: 17609 [2018-12-31 17:24:38,501 INFO L226 Difference]: Without dead ends: 15449 [2018-12-31 17:24:38,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 17:24:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15449 states. [2018-12-31 17:24:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15449 to 13373. [2018-12-31 17:24:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13373 states. [2018-12-31 17:24:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13373 states to 13373 states and 53076 transitions. [2018-12-31 17:24:38,759 INFO L78 Accepts]: Start accepts. Automaton has 13373 states and 53076 transitions. Word has length 52 [2018-12-31 17:24:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:38,759 INFO L480 AbstractCegarLoop]: Abstraction has 13373 states and 53076 transitions. [2018-12-31 17:24:38,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 17:24:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13373 states and 53076 transitions. [2018-12-31 17:24:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 17:24:38,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:38,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:38,774 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash -645490969, now seen corresponding path program 4 times [2018-12-31 17:24:38,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:38,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:38,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:39,482 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 17:24:39,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:39,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 17:24:39,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 17:24:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 17:24:39,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-12-31 17:24:39,484 INFO L87 Difference]: Start difference. First operand 13373 states and 53076 transitions. Second operand 18 states. [2018-12-31 17:24:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:40,530 INFO L93 Difference]: Finished difference Result 19310 states and 73665 transitions. [2018-12-31 17:24:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 17:24:40,531 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-31 17:24:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:40,571 INFO L225 Difference]: With dead ends: 19310 [2018-12-31 17:24:40,571 INFO L226 Difference]: Without dead ends: 18590 [2018-12-31 17:24:40,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-12-31 17:24:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18590 states. [2018-12-31 17:24:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18590 to 12634. [2018-12-31 17:24:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12634 states. [2018-12-31 17:24:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12634 states to 12634 states and 50125 transitions. [2018-12-31 17:24:40,839 INFO L78 Accepts]: Start accepts. Automaton has 12634 states and 50125 transitions. Word has length 52 [2018-12-31 17:24:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:40,839 INFO L480 AbstractCegarLoop]: Abstraction has 12634 states and 50125 transitions. [2018-12-31 17:24:40,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 17:24:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 12634 states and 50125 transitions. [2018-12-31 17:24:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 17:24:40,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:40,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:40,855 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1387947128, now seen corresponding path program 1 times [2018-12-31 17:24:40,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:40,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:24:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:41,878 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 17:24:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:41,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-31 17:24:41,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 17:24:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 17:24:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-12-31 17:24:41,881 INFO L87 Difference]: Start difference. First operand 12634 states and 50125 transitions. Second operand 20 states. [2018-12-31 17:24:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:43,783 INFO L93 Difference]: Finished difference Result 11254 states and 43666 transitions. [2018-12-31 17:24:43,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 17:24:43,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-12-31 17:24:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:43,807 INFO L225 Difference]: With dead ends: 11254 [2018-12-31 17:24:43,808 INFO L226 Difference]: Without dead ends: 10678 [2018-12-31 17:24:43,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2018-12-31 17:24:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10678 states. [2018-12-31 17:24:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10678 to 6913. [2018-12-31 17:24:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2018-12-31 17:24:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 28314 transitions. [2018-12-31 17:24:43,953 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 28314 transitions. Word has length 54 [2018-12-31 17:24:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:43,953 INFO L480 AbstractCegarLoop]: Abstraction has 6913 states and 28314 transitions. [2018-12-31 17:24:43,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 17:24:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 28314 transitions. [2018-12-31 17:24:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 17:24:43,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:43,966 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] [2018-12-31 17:24:43,966 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash 831472606, now seen corresponding path program 1 times [2018-12-31 17:24:43,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:43,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:43,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:44,122 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 17:24:44,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:44,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 17:24:44,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 17:24:44,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 17:24:44,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 17:24:44,123 INFO L87 Difference]: Start difference. First operand 6913 states and 28314 transitions. Second operand 8 states. [2018-12-31 17:24:44,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:44,330 INFO L93 Difference]: Finished difference Result 6913 states and 28308 transitions. [2018-12-31 17:24:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 17:24:44,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-12-31 17:24:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:44,348 INFO L225 Difference]: With dead ends: 6913 [2018-12-31 17:24:44,348 INFO L226 Difference]: Without dead ends: 6868 [2018-12-31 17:24:44,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-12-31 17:24:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2018-12-31 17:24:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2018-12-31 17:24:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6868 states. [2018-12-31 17:24:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 28122 transitions. [2018-12-31 17:24:44,467 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 28122 transitions. Word has length 87 [2018-12-31 17:24:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:44,467 INFO L480 AbstractCegarLoop]: Abstraction has 6868 states and 28122 transitions. [2018-12-31 17:24:44,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 17:24:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 28122 transitions. [2018-12-31 17:24:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 17:24:44,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:44,479 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] [2018-12-31 17:24:44,479 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash 531803949, now seen corresponding path program 1 times [2018-12-31 17:24:44,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:44,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:44,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:44,912 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 17:24:44,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:44,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 17:24:44,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 17:24:44,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 17:24:44,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 17:24:44,913 INFO L87 Difference]: Start difference. First operand 6868 states and 28122 transitions. Second operand 9 states. [2018-12-31 17:24:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:45,126 INFO L93 Difference]: Finished difference Result 6868 states and 28116 transitions. [2018-12-31 17:24:45,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 17:24:45,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-31 17:24:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:45,144 INFO L225 Difference]: With dead ends: 6868 [2018-12-31 17:24:45,144 INFO L226 Difference]: Without dead ends: 6670 [2018-12-31 17:24:45,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-31 17:24:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2018-12-31 17:24:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2018-12-31 17:24:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2018-12-31 17:24:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27300 transitions. [2018-12-31 17:24:45,261 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27300 transitions. Word has length 87 [2018-12-31 17:24:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:45,262 INFO L480 AbstractCegarLoop]: Abstraction has 6670 states and 27300 transitions. [2018-12-31 17:24:45,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 17:24:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27300 transitions. [2018-12-31 17:24:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 17:24:45,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:45,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:24:45,274 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:45,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash -293321056, now seen corresponding path program 1 times [2018-12-31 17:24:45,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:45,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:45,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:24:45,646 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 17:24:45,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:24:45,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 17:24:45,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 17:24:45,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 17:24:45,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-31 17:24:45,648 INFO L87 Difference]: Start difference. First operand 6670 states and 27300 transitions. Second operand 12 states. [2018-12-31 17:24:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:24:46,139 INFO L93 Difference]: Finished difference Result 6670 states and 27264 transitions. [2018-12-31 17:24:46,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 17:24:46,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-12-31 17:24:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:24:46,155 INFO L225 Difference]: With dead ends: 6670 [2018-12-31 17:24:46,156 INFO L226 Difference]: Without dead ends: 6328 [2018-12-31 17:24:46,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-12-31 17:24:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2018-12-31 17:24:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 6328. [2018-12-31 17:24:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-31 17:24:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 25848 transitions. [2018-12-31 17:24:46,338 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 25848 transitions. Word has length 87 [2018-12-31 17:24:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:24:46,339 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 25848 transitions. [2018-12-31 17:24:46,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 17:24:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 25848 transitions. [2018-12-31 17:24:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-31 17:24:46,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:24:46,350 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] [2018-12-31 17:24:46,350 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:24:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:24:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1360449134, now seen corresponding path program 1 times [2018-12-31 17:24:46,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:24:46,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:24:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:46,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:24:46,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:24:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 17:24:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 17:24:46,456 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 17:24:46,626 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 17:24:46,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:24:46 BasicIcfg [2018-12-31 17:24:46,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 17:24:46,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 17:24:46,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 17:24:46,634 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 17:24:46,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:23:04" (3/4) ... [2018-12-31 17:24:46,638 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 17:24:46,776 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 17:24:46,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 17:24:46,779 INFO L168 Benchmark]: Toolchain (without parser) took 104029.66 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 947.3 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 763.5 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:46,780 INFO L168 Benchmark]: CDTParser took 0.15 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 17:24:46,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 998.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:46,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:46,784 INFO L168 Benchmark]: Boogie Preprocessor took 35.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 17:24:46,784 INFO L168 Benchmark]: RCFGBuilder took 712.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:46,789 INFO L168 Benchmark]: TraceAbstraction took 102063.24 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 725.0 MB. Max. memory is 11.5 GB. [2018-12-31 17:24:46,790 INFO L168 Benchmark]: Witness Printer took 145.56 ms. Allocated memory is still 5.3 GB. Free memory is still 4.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 17:24:46,803 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.15 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 998.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 712.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 102063.24 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 725.0 MB. Max. memory is 11.5 GB. * Witness Printer took 145.56 ms. Allocated memory is still 5.3 GB. Free memory is still 4.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1212]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1213] -1 char *v; VAL [v={0:0}] [L1246] -1 pthread_t t; VAL [v={0:0}] [L1247] FCALL, FORK -1 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={7:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={0:0}] [L1248] -1 \read(t) VAL [arg={0:0}, arg={0:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={0:0}] [L1232] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={0:0}] [L1216] 1 v = malloc(sizeof(char)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1217] 1 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1233] 0 \read(t1) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1233] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1234] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1221] 2 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1235] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1222] 2 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1236] FCALL, FORK 0 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1237] FCALL, FORK 0 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1221] 4 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1222] 4 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1238] 0 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1238] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1239] 0 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1221] 5 v[0] = 'X' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1222] 5 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1226] 3 v[0] = 'Y' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1227] 3 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1239] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1240] 0 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1240] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1241] 0 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1241] FCALL, JOIN 4 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t1={7:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t2={1:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t3={-1:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t4={2:0}, t5={-2:0}, v={9:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, t5={-2:0}, v={9:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, v={9:0}] [L1248] FCALL, JOIN 0 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, v={9:0}] [L1249] -1 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, v={9:0}] [L1212] COND TRUE -1 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, v={9:0}] [L1212] -1 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={9:0}, v={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 166 locations, 1 error locations. UNSAFE Result, 101.3s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 47.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6814 SDtfs, 16045 SDslu, 33349 SDs, 0 SdLazy, 14382 SolverSat, 1777 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 851 GetRequests, 129 SyntacticMatches, 39 SemanticMatches, 683 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2935 ImplicationChecksByTransitivity, 31.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47312occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 28.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 217999 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 1870 NumberOfCodeBlocks, 1870 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1747 ConstructedInterpolants, 0 QuantifiedInterpolants, 1176456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...