./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 0ed9222f 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-0ed9222-m [2019-01-12 22:17:53,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 22:17:53,836 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 22:17:53,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 22:17:53,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 22:17:53,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 22:17:53,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 22:17:53,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 22:17:53,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 22:17:53,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 22:17:53,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 22:17:53,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 22:17:53,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 22:17:53,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 22:17:53,861 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 22:17:53,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 22:17:53,863 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 22:17:53,865 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 22:17:53,867 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 22:17:53,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 22:17:53,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 22:17:53,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 22:17:53,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 22:17:53,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 22:17:53,874 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 22:17:53,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 22:17:53,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 22:17:53,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 22:17:53,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 22:17:53,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 22:17:53,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 22:17:53,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 22:17:53,880 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 22:17:53,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 22:17:53,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 22:17:53,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 22:17:53,883 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 22:17:53,906 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 22:17:53,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 22:17:53,908 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 22:17:53,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 22:17:53,908 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 22:17:53,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 22:17:53,909 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 22:17:53,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 22:17:53,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 22:17:53,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 22:17:53,910 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 22:17:53,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 22:17:53,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 22:17:53,912 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 22:17:53,913 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 22:17:53,913 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 22:17:53,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 22:17:53,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 22:17:53,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 22:17:53,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 22:17:53,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 22:17:53,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 22:17:53,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 22:17:53,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 22:17:53,917 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 22:17:53,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 22:17:53,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 22:17:53,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 22:17:53,918 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 [2019-01-12 22:17:53,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 22:17:54,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 22:17:54,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 22:17:54,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 22:17:54,014 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 22:17:54,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread/singleton_false-unreach-call.i [2019-01-12 22:17:54,082 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4dece57f/684bb817027348cd9e343d735fb0250b/FLAG1c0f23787 [2019-01-12 22:17:54,607 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 22:17:54,609 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread/singleton_false-unreach-call.i [2019-01-12 22:17:54,631 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4dece57f/684bb817027348cd9e343d735fb0250b/FLAG1c0f23787 [2019-01-12 22:17:54,855 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4dece57f/684bb817027348cd9e343d735fb0250b [2019-01-12 22:17:54,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 22:17:54,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 22:17:54,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 22:17:54,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 22:17:54,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 22:17:54,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:17:54" (1/1) ... [2019-01-12 22:17:54,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f540a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:54, skipping insertion in model container [2019-01-12 22:17:54,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:17:54" (1/1) ... [2019-01-12 22:17:54,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 22:17:54,947 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 22:17:55,665 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:17:55,682 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 22:17:55,855 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 22:17:56,070 INFO L195 MainTranslator]: Completed translation [2019-01-12 22:17:56,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56 WrapperNode [2019-01-12 22:17:56,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 22:17:56,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 22:17:56,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 22:17:56,072 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 22:17:56,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 22:17:56,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 22:17:56,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 22:17:56,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 22:17:56,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (1/1) ... [2019-01-12 22:17:56,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 22:17:56,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 22:17:56,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 22:17:56,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 22:17:56,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (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 [2019-01-12 22:17:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 22:17:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 22:17:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 22:17:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-01-12 22:17:56,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-01-12 22:17:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-01-12 22:17:56,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-01-12 22:17:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-01-12 22:17:56,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-01-12 22:17:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-01-12 22:17:56,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-01-12 22:17:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 22:17:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 22:17:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 22:17:56,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 22:17:56,264 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 22:17:56,914 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 22:17:56,915 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-12 22:17:56,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:17:56 BoogieIcfgContainer [2019-01-12 22:17:56,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 22:17:56,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 22:17:56,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 22:17:56,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 22:17:56,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:17:54" (1/3) ... [2019-01-12 22:17:56,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6077cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:17:56, skipping insertion in model container [2019-01-12 22:17:56,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:17:56" (2/3) ... [2019-01-12 22:17:56,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6077cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:17:56, skipping insertion in model container [2019-01-12 22:17:56,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:17:56" (3/3) ... [2019-01-12 22:17:56,925 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_false-unreach-call.i [2019-01-12 22:17:56,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,971 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,971 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,972 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,972 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,972 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,973 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,974 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,975 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,976 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,976 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,976 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,977 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,978 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,979 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,980 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,981 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,981 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,981 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,981 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,982 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,982 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,982 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,982 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,986 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,986 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,986 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,986 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,987 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,987 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,987 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,987 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,988 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,988 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,988 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,988 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,988 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,989 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,989 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,989 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,989 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,989 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,990 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,990 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,990 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,990 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,991 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,991 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,991 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,992 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,992 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,993 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,993 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,993 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,993 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,993 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,994 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,994 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,994 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,995 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:56,995 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 22:17:57,545 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 22:17:57,546 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 22:17:57,556 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 22:17:57,574 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 22:17:57,602 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 22:17:57,602 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 22:17:57,603 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 22:17:57,603 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 22:17:57,603 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 22:17:57,603 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 22:17:57,603 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 22:17:57,603 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 22:17:57,604 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 22:17:57,618 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139places, 232 transitions [2019-01-12 22:18:01,694 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47312 states. [2019-01-12 22:18:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 47312 states. [2019-01-12 22:18:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 22:18:01,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:01,710 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] [2019-01-12 22:18:01,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:01,719 INFO L82 PathProgramCache]: Analyzing trace with hash 973446305, now seen corresponding path program 1 times [2019-01-12 22:18:01,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:01,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:01,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:01,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:01,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:02,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:02,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:18:02,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:18:02,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:18:02,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:18:02,389 INFO L87 Difference]: Start difference. First operand 47312 states. Second operand 10 states. [2019-01-12 22:18:02,751 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-01-12 22:18:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:05,021 INFO L93 Difference]: Finished difference Result 53969 states and 232570 transitions. [2019-01-12 22:18:05,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:18:05,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-01-12 22:18:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:05,336 INFO L225 Difference]: With dead ends: 53969 [2019-01-12 22:18:05,336 INFO L226 Difference]: Without dead ends: 38044 [2019-01-12 22:18:05,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:18:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38044 states. [2019-01-12 22:18:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38044 to 31405. [2019-01-12 22:18:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31405 states. [2019-01-12 22:18:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31405 states to 31405 states and 135819 transitions. [2019-01-12 22:18:07,339 INFO L78 Accepts]: Start accepts. Automaton has 31405 states and 135819 transitions. Word has length 31 [2019-01-12 22:18:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:07,340 INFO L480 AbstractCegarLoop]: Abstraction has 31405 states and 135819 transitions. [2019-01-12 22:18:07,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:18:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 31405 states and 135819 transitions. [2019-01-12 22:18:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 22:18:07,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:07,344 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] [2019-01-12 22:18:07,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash -320847025, now seen corresponding path program 2 times [2019-01-12 22:18:07,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:07,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:07,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:07,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:07,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:18:07,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:18:07,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:18:07,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:18:07,621 INFO L87 Difference]: Start difference. First operand 31405 states and 135819 transitions. Second operand 10 states. [2019-01-12 22:18:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:09,681 INFO L93 Difference]: Finished difference Result 44657 states and 198278 transitions. [2019-01-12 22:18:09,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:18:09,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-01-12 22:18:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:10,124 INFO L225 Difference]: With dead ends: 44657 [2019-01-12 22:18:10,124 INFO L226 Difference]: Without dead ends: 44657 [2019-01-12 22:18:10,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:18:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2019-01-12 22:18:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 31363. [2019-01-12 22:18:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31363 states. [2019-01-12 22:18:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31363 states to 31363 states and 135747 transitions. [2019-01-12 22:18:11,369 INFO L78 Accepts]: Start accepts. Automaton has 31363 states and 135747 transitions. Word has length 31 [2019-01-12 22:18:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:11,370 INFO L480 AbstractCegarLoop]: Abstraction has 31363 states and 135747 transitions. [2019-01-12 22:18:11,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:18:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 31363 states and 135747 transitions. [2019-01-12 22:18:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 22:18:11,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:11,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:18:11,383 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:11,384 INFO L82 PathProgramCache]: Analyzing trace with hash 931900819, now seen corresponding path program 1 times [2019-01-12 22:18:11,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:11,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:11,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:11,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:18:11,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:11,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:11,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 22:18:11,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 22:18:11,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 22:18:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 22:18:11,506 INFO L87 Difference]: Start difference. First operand 31363 states and 135747 transitions. Second operand 6 states. [2019-01-12 22:18:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:12,672 INFO L93 Difference]: Finished difference Result 67819 states and 285625 transitions. [2019-01-12 22:18:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:18:12,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-01-12 22:18:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:12,841 INFO L225 Difference]: With dead ends: 67819 [2019-01-12 22:18:12,842 INFO L226 Difference]: Without dead ends: 41885 [2019-01-12 22:18:12,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 22:18:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41885 states. [2019-01-12 22:18:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41885 to 32363. [2019-01-12 22:18:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32363 states. [2019-01-12 22:18:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32363 states to 32363 states and 134937 transitions. [2019-01-12 22:18:14,901 INFO L78 Accepts]: Start accepts. Automaton has 32363 states and 134937 transitions. Word has length 41 [2019-01-12 22:18:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:14,901 INFO L480 AbstractCegarLoop]: Abstraction has 32363 states and 134937 transitions. [2019-01-12 22:18:14,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 22:18:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32363 states and 134937 transitions. [2019-01-12 22:18:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 22:18:14,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:14,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:18:14,916 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:14,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1536072140, now seen corresponding path program 1 times [2019-01-12 22:18:14,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:14,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:14,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:14,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:15,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:15,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:18:15,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:18:15,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:18:15,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:18:15,121 INFO L87 Difference]: Start difference. First operand 32363 states and 134937 transitions. Second operand 7 states. [2019-01-12 22:18:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:15,681 INFO L93 Difference]: Finished difference Result 39181 states and 163715 transitions. [2019-01-12 22:18:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:18:15,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-01-12 22:18:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:15,791 INFO L225 Difference]: With dead ends: 39181 [2019-01-12 22:18:15,791 INFO L226 Difference]: Without dead ends: 39109 [2019-01-12 22:18:15,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:18:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39109 states. [2019-01-12 22:18:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39109 to 35466. [2019-01-12 22:18:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2019-01-12 22:18:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 149245 transitions. [2019-01-12 22:18:16,645 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 149245 transitions. Word has length 43 [2019-01-12 22:18:16,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:16,645 INFO L480 AbstractCegarLoop]: Abstraction has 35466 states and 149245 transitions. [2019-01-12 22:18:16,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:18:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 149245 transitions. [2019-01-12 22:18:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 22:18:16,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:16,665 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] [2019-01-12 22:18:16,665 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:16,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1098530636, now seen corresponding path program 2 times [2019-01-12 22:18:16,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:16,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:16,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:16,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:18:16,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:18:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:18:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:18:16,868 INFO L87 Difference]: Start difference. First operand 35466 states and 149245 transitions. Second operand 10 states. [2019-01-12 22:18:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:17,759 INFO L93 Difference]: Finished difference Result 49948 states and 204487 transitions. [2019-01-12 22:18:17,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:18:17,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-01-12 22:18:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:17,883 INFO L225 Difference]: With dead ends: 49948 [2019-01-12 22:18:17,883 INFO L226 Difference]: Without dead ends: 45132 [2019-01-12 22:18:17,883 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 [2019-01-12 22:18:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45132 states. [2019-01-12 22:18:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45132 to 35381. [2019-01-12 22:18:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35381 states. [2019-01-12 22:18:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 148987 transitions. [2019-01-12 22:18:21,913 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 148987 transitions. Word has length 43 [2019-01-12 22:18:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:21,913 INFO L480 AbstractCegarLoop]: Abstraction has 35381 states and 148987 transitions. [2019-01-12 22:18:21,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:18:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 148987 transitions. [2019-01-12 22:18:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 22:18:21,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:21,930 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] [2019-01-12 22:18:21,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash 868178546, now seen corresponding path program 1 times [2019-01-12 22:18:21,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:21,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:21,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:21,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:18:21,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:22,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:22,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:18:22,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:18:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:18:22,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:18:22,337 INFO L87 Difference]: Start difference. First operand 35381 states and 148987 transitions. Second operand 7 states. [2019-01-12 22:18:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:22,894 INFO L93 Difference]: Finished difference Result 38268 states and 158857 transitions. [2019-01-12 22:18:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:18:22,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-01-12 22:18:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:22,999 INFO L225 Difference]: With dead ends: 38268 [2019-01-12 22:18:22,999 INFO L226 Difference]: Without dead ends: 37788 [2019-01-12 22:18:22,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:18:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37788 states. [2019-01-12 22:18:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37788 to 36092. [2019-01-12 22:18:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2019-01-12 22:18:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 150963 transitions. [2019-01-12 22:18:24,498 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 150963 transitions. Word has length 44 [2019-01-12 22:18:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:24,499 INFO L480 AbstractCegarLoop]: Abstraction has 36092 states and 150963 transitions. [2019-01-12 22:18:24,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:18:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 150963 transitions. [2019-01-12 22:18:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 22:18:24,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:24,514 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] [2019-01-12 22:18:24,514 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash -108546428, now seen corresponding path program 2 times [2019-01-12 22:18:24,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:24,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:24,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:24,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:24,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:25,017 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-01-12 22:18:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:25,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:25,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-12 22:18:25,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 22:18:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 22:18:25,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:18:25,262 INFO L87 Difference]: Start difference. First operand 36092 states and 150963 transitions. Second operand 17 states. [2019-01-12 22:18:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:26,649 INFO L93 Difference]: Finished difference Result 42947 states and 180286 transitions. [2019-01-12 22:18:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:18:26,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-12 22:18:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:26,771 INFO L225 Difference]: With dead ends: 42947 [2019-01-12 22:18:26,772 INFO L226 Difference]: Without dead ends: 42701 [2019-01-12 22:18:26,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-01-12 22:18:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42701 states. [2019-01-12 22:18:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42701 to 39077. [2019-01-12 22:18:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39077 states. [2019-01-12 22:18:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39077 states to 39077 states and 165463 transitions. [2019-01-12 22:18:27,665 INFO L78 Accepts]: Start accepts. Automaton has 39077 states and 165463 transitions. Word has length 44 [2019-01-12 22:18:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:27,666 INFO L480 AbstractCegarLoop]: Abstraction has 39077 states and 165463 transitions. [2019-01-12 22:18:27,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 22:18:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 39077 states and 165463 transitions. [2019-01-12 22:18:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 22:18:27,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:27,684 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] [2019-01-12 22:18:27,684 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:27,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:27,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1310405846, now seen corresponding path program 3 times [2019-01-12 22:18:27,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:27,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:27,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:27,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:18:27,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:28,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:28,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-12 22:18:28,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 22:18:28,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 22:18:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-01-12 22:18:28,146 INFO L87 Difference]: Start difference. First operand 39077 states and 165463 transitions. Second operand 14 states. [2019-01-12 22:18:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:28,950 INFO L93 Difference]: Finished difference Result 52363 states and 221974 transitions. [2019-01-12 22:18:28,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 22:18:28,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-01-12 22:18:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:29,104 INFO L225 Difference]: With dead ends: 52363 [2019-01-12 22:18:29,104 INFO L226 Difference]: Without dead ends: 52117 [2019-01-12 22:18:29,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-01-12 22:18:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52117 states. [2019-01-12 22:18:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52117 to 39004. [2019-01-12 22:18:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39004 states. [2019-01-12 22:18:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39004 states to 39004 states and 165236 transitions. [2019-01-12 22:18:30,770 INFO L78 Accepts]: Start accepts. Automaton has 39004 states and 165236 transitions. Word has length 44 [2019-01-12 22:18:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:30,771 INFO L480 AbstractCegarLoop]: Abstraction has 39004 states and 165236 transitions. [2019-01-12 22:18:30,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 22:18:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 39004 states and 165236 transitions. [2019-01-12 22:18:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 22:18:30,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:30,793 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] [2019-01-12 22:18:30,793 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1846578174, now seen corresponding path program 1 times [2019-01-12 22:18:30,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:30,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:18:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:31,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:31,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 22:18:31,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 22:18:31,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 22:18:31,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:18:31,255 INFO L87 Difference]: Start difference. First operand 39004 states and 165236 transitions. Second operand 12 states. [2019-01-12 22:18:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:32,130 INFO L93 Difference]: Finished difference Result 55509 states and 228067 transitions. [2019-01-12 22:18:32,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:18:32,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-01-12 22:18:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:32,263 INFO L225 Difference]: With dead ends: 55509 [2019-01-12 22:18:32,263 INFO L226 Difference]: Without dead ends: 48865 [2019-01-12 22:18:32,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-01-12 22:18:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48865 states. [2019-01-12 22:18:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48865 to 38732. [2019-01-12 22:18:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38732 states. [2019-01-12 22:18:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38732 states to 38732 states and 164174 transitions. [2019-01-12 22:18:33,167 INFO L78 Accepts]: Start accepts. Automaton has 38732 states and 164174 transitions. Word has length 46 [2019-01-12 22:18:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:33,167 INFO L480 AbstractCegarLoop]: Abstraction has 38732 states and 164174 transitions. [2019-01-12 22:18:33,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 22:18:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 38732 states and 164174 transitions. [2019-01-12 22:18:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 22:18:33,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:33,188 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] [2019-01-12 22:18:33,188 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 649545214, now seen corresponding path program 1 times [2019-01-12 22:18:33,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:33,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:33,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:33,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:18:33,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:18:33,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:18:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:18:33,898 INFO L87 Difference]: Start difference. First operand 38732 states and 164174 transitions. Second operand 16 states. [2019-01-12 22:18:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:35,242 INFO L93 Difference]: Finished difference Result 47685 states and 201782 transitions. [2019-01-12 22:18:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:18:35,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2019-01-12 22:18:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:35,870 INFO L225 Difference]: With dead ends: 47685 [2019-01-12 22:18:35,870 INFO L226 Difference]: Without dead ends: 47379 [2019-01-12 22:18:35,871 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 [2019-01-12 22:18:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47379 states. [2019-01-12 22:18:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47379 to 40772. [2019-01-12 22:18:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40772 states. [2019-01-12 22:18:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40772 states to 40772 states and 173863 transitions. [2019-01-12 22:18:36,762 INFO L78 Accepts]: Start accepts. Automaton has 40772 states and 173863 transitions. Word has length 46 [2019-01-12 22:18:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:36,762 INFO L480 AbstractCegarLoop]: Abstraction has 40772 states and 173863 transitions. [2019-01-12 22:18:36,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:18:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 40772 states and 173863 transitions. [2019-01-12 22:18:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 22:18:36,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:36,786 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] [2019-01-12 22:18:36,786 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash 299199095, now seen corresponding path program 1 times [2019-01-12 22:18:36,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:36,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:36,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:36,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:37,526 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-01-12 22:18:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:38,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:38,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:18:38,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:18:38,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:18:38,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:18:38,217 INFO L87 Difference]: Start difference. First operand 40772 states and 173863 transitions. Second operand 16 states. [2019-01-12 22:18:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:39,715 INFO L93 Difference]: Finished difference Result 49321 states and 207286 transitions. [2019-01-12 22:18:39,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 22:18:39,717 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2019-01-12 22:18:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:39,854 INFO L225 Difference]: With dead ends: 49321 [2019-01-12 22:18:39,854 INFO L226 Difference]: Without dead ends: 49015 [2019-01-12 22:18:39,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2019-01-12 22:18:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49015 states. [2019-01-12 22:18:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49015 to 38645. [2019-01-12 22:18:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38645 states. [2019-01-12 22:18:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38645 states to 38645 states and 163925 transitions. [2019-01-12 22:18:40,764 INFO L78 Accepts]: Start accepts. Automaton has 38645 states and 163925 transitions. Word has length 46 [2019-01-12 22:18:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:40,765 INFO L480 AbstractCegarLoop]: Abstraction has 38645 states and 163925 transitions. [2019-01-12 22:18:40,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:18:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 38645 states and 163925 transitions. [2019-01-12 22:18:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 22:18:40,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:40,788 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] [2019-01-12 22:18:40,788 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1385009275, now seen corresponding path program 1 times [2019-01-12 22:18:40,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:40,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:40,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:40,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:18:41,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:18:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:18:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:18:41,585 INFO L87 Difference]: Start difference. First operand 38645 states and 163925 transitions. Second operand 18 states. [2019-01-12 22:18:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:42,964 INFO L93 Difference]: Finished difference Result 48234 states and 205456 transitions. [2019-01-12 22:18:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:18:42,965 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2019-01-12 22:18:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:43,125 INFO L225 Difference]: With dead ends: 48234 [2019-01-12 22:18:43,125 INFO L226 Difference]: Without dead ends: 47988 [2019-01-12 22:18:43,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2019-01-12 22:18:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47988 states. [2019-01-12 22:18:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47988 to 37705. [2019-01-12 22:18:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37705 states. [2019-01-12 22:18:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37705 states to 37705 states and 160287 transitions. [2019-01-12 22:18:44,528 INFO L78 Accepts]: Start accepts. Automaton has 37705 states and 160287 transitions. Word has length 46 [2019-01-12 22:18:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:44,529 INFO L480 AbstractCegarLoop]: Abstraction has 37705 states and 160287 transitions. [2019-01-12 22:18:44,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:18:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37705 states and 160287 transitions. [2019-01-12 22:18:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 22:18:44,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:44,549 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] [2019-01-12 22:18:44,550 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:44,550 INFO L82 PathProgramCache]: Analyzing trace with hash 646721030, now seen corresponding path program 2 times [2019-01-12 22:18:44,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:44,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:44,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:44,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:44,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 22:18:44,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 22:18:44,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 22:18:44,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-01-12 22:18:44,817 INFO L87 Difference]: Start difference. First operand 37705 states and 160287 transitions. Second operand 12 states. [2019-01-12 22:18:45,744 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-12 22:18:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:46,643 INFO L93 Difference]: Finished difference Result 51730 states and 218578 transitions. [2019-01-12 22:18:46,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:18:46,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-01-12 22:18:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:46,790 INFO L225 Difference]: With dead ends: 51730 [2019-01-12 22:18:46,790 INFO L226 Difference]: Without dead ends: 51424 [2019-01-12 22:18:46,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:18:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51424 states. [2019-01-12 22:18:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51424 to 37547. [2019-01-12 22:18:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37547 states. [2019-01-12 22:18:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37547 states to 37547 states and 159872 transitions. [2019-01-12 22:18:47,715 INFO L78 Accepts]: Start accepts. Automaton has 37547 states and 159872 transitions. Word has length 46 [2019-01-12 22:18:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:47,715 INFO L480 AbstractCegarLoop]: Abstraction has 37547 states and 159872 transitions. [2019-01-12 22:18:47,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 22:18:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37547 states and 159872 transitions. [2019-01-12 22:18:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 22:18:47,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:47,742 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] [2019-01-12 22:18:47,743 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -257915841, now seen corresponding path program 1 times [2019-01-12 22:18:47,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:47,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:47,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:18:47,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:48,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:48,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-01-12 22:18:48,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 22:18:48,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 22:18:48,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-01-12 22:18:48,706 INFO L87 Difference]: Start difference. First operand 37547 states and 159872 transitions. Second operand 19 states. [2019-01-12 22:18:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:50,042 INFO L93 Difference]: Finished difference Result 42943 states and 180662 transitions. [2019-01-12 22:18:50,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:18:50,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-01-12 22:18:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:50,164 INFO L225 Difference]: With dead ends: 42943 [2019-01-12 22:18:50,164 INFO L226 Difference]: Without dead ends: 42637 [2019-01-12 22:18:50,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-01-12 22:18:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42637 states. [2019-01-12 22:18:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42637 to 34160. [2019-01-12 22:18:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2019-01-12 22:18:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 144012 transitions. [2019-01-12 22:18:50,970 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 144012 transitions. Word has length 48 [2019-01-12 22:18:50,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:50,970 INFO L480 AbstractCegarLoop]: Abstraction has 34160 states and 144012 transitions. [2019-01-12 22:18:50,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 22:18:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 144012 transitions. [2019-01-12 22:18:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:18:50,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:50,995 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] [2019-01-12 22:18:50,995 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1732785392, now seen corresponding path program 1 times [2019-01-12 22:18:50,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:50,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:50,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:51,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:18:51,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:18:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:18:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:18:51,238 INFO L87 Difference]: Start difference. First operand 34160 states and 144012 transitions. Second operand 7 states. [2019-01-12 22:18:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:51,747 INFO L93 Difference]: Finished difference Result 38880 states and 161858 transitions. [2019-01-12 22:18:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:18:51,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-01-12 22:18:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:52,250 INFO L225 Difference]: With dead ends: 38880 [2019-01-12 22:18:52,251 INFO L226 Difference]: Without dead ends: 38046 [2019-01-12 22:18:52,251 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 [2019-01-12 22:18:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38046 states. [2019-01-12 22:18:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38046 to 36228. [2019-01-12 22:18:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36228 states. [2019-01-12 22:18:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36228 states to 36228 states and 152400 transitions. [2019-01-12 22:18:53,018 INFO L78 Accepts]: Start accepts. Automaton has 36228 states and 152400 transitions. Word has length 49 [2019-01-12 22:18:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:53,019 INFO L480 AbstractCegarLoop]: Abstraction has 36228 states and 152400 transitions. [2019-01-12 22:18:53,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:18:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 36228 states and 152400 transitions. [2019-01-12 22:18:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:18:53,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:53,056 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] [2019-01-12 22:18:53,056 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash -13513647, now seen corresponding path program 1 times [2019-01-12 22:18:53,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:53,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:53,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:18:54,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:18:54,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-12 22:18:54,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 22:18:54,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 22:18:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:18:54,298 INFO L87 Difference]: Start difference. First operand 36228 states and 152400 transitions. Second operand 20 states. [2019-01-12 22:18:55,201 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-01-12 22:18:55,401 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-01-12 22:18:55,604 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-01-12 22:18:55,744 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-01-12 22:18:57,371 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-01-12 22:18:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:18:58,274 INFO L93 Difference]: Finished difference Result 38154 states and 158626 transitions. [2019-01-12 22:18:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 22:18:58,275 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2019-01-12 22:18:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:18:58,382 INFO L225 Difference]: With dead ends: 38154 [2019-01-12 22:18:58,382 INFO L226 Difference]: Without dead ends: 37938 [2019-01-12 22:18:58,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=319, Invalid=1163, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 22:18:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37938 states. [2019-01-12 22:18:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37938 to 31880. [2019-01-12 22:18:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31880 states. [2019-01-12 22:18:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31880 states to 31880 states and 132794 transitions. [2019-01-12 22:18:59,113 INFO L78 Accepts]: Start accepts. Automaton has 31880 states and 132794 transitions. Word has length 49 [2019-01-12 22:18:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:18:59,113 INFO L480 AbstractCegarLoop]: Abstraction has 31880 states and 132794 transitions. [2019-01-12 22:18:59,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 22:18:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 31880 states and 132794 transitions. [2019-01-12 22:18:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:18:59,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:18:59,149 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] [2019-01-12 22:18:59,149 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:18:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:18:59,150 INFO L82 PathProgramCache]: Analyzing trace with hash -114085722, now seen corresponding path program 1 times [2019-01-12 22:18:59,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:18:59,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:18:59,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:59,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:18:59,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:18:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:18:59,330 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 22:18:59,507 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 22:19:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:00,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:00,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-12 22:19:00,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 22:19:00,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 22:19:00,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:19:00,738 INFO L87 Difference]: Start difference. First operand 31880 states and 132794 transitions. Second operand 20 states. [2019-01-12 22:19:01,600 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-01-12 22:19:01,758 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-01-12 22:19:01,894 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-01-12 22:19:02,044 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-01-12 22:19:02,225 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-01-12 22:19:02,928 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-01-12 22:19:03,171 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-12 22:19:03,565 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-12 22:19:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:04,079 INFO L93 Difference]: Finished difference Result 34540 states and 142264 transitions. [2019-01-12 22:19:04,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 22:19:04,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2019-01-12 22:19:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:04,171 INFO L225 Difference]: With dead ends: 34540 [2019-01-12 22:19:04,171 INFO L226 Difference]: Without dead ends: 33100 [2019-01-12 22:19:04,172 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 [2019-01-12 22:19:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33100 states. [2019-01-12 22:19:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33100 to 23509. [2019-01-12 22:19:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23509 states. [2019-01-12 22:19:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23509 states to 23509 states and 96496 transitions. [2019-01-12 22:19:04,786 INFO L78 Accepts]: Start accepts. Automaton has 23509 states and 96496 transitions. Word has length 49 [2019-01-12 22:19:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:04,787 INFO L480 AbstractCegarLoop]: Abstraction has 23509 states and 96496 transitions. [2019-01-12 22:19:04,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 22:19:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 23509 states and 96496 transitions. [2019-01-12 22:19:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:19:04,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:04,808 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] [2019-01-12 22:19:04,808 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash -672953966, now seen corresponding path program 2 times [2019-01-12 22:19:04,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:04,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:05,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:05,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:19:05,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:19:05,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:19:05,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:19:05,422 INFO L87 Difference]: Start difference. First operand 23509 states and 96496 transitions. Second operand 16 states. [2019-01-12 22:19:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:06,039 INFO L93 Difference]: Finished difference Result 28138 states and 114119 transitions. [2019-01-12 22:19:06,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 22:19:06,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-01-12 22:19:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:06,111 INFO L225 Difference]: With dead ends: 28138 [2019-01-12 22:19:06,111 INFO L226 Difference]: Without dead ends: 27349 [2019-01-12 22:19:06,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:19:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27349 states. [2019-01-12 22:19:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27349 to 23509. [2019-01-12 22:19:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23509 states. [2019-01-12 22:19:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23509 states to 23509 states and 96496 transitions. [2019-01-12 22:19:06,906 INFO L78 Accepts]: Start accepts. Automaton has 23509 states and 96496 transitions. Word has length 49 [2019-01-12 22:19:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:06,906 INFO L480 AbstractCegarLoop]: Abstraction has 23509 states and 96496 transitions. [2019-01-12 22:19:06,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:19:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 23509 states and 96496 transitions. [2019-01-12 22:19:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:19:06,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:06,925 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] [2019-01-12 22:19:06,926 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:06,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1155264282, now seen corresponding path program 3 times [2019-01-12 22:19:06,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:06,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:06,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:06,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:06,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:07,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:07,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-01-12 22:19:07,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 22:19:07,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 22:19:07,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-01-12 22:19:07,736 INFO L87 Difference]: Start difference. First operand 23509 states and 96496 transitions. Second operand 19 states. [2019-01-12 22:19:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:09,048 INFO L93 Difference]: Finished difference Result 29908 states and 121294 transitions. [2019-01-12 22:19:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 22:19:09,049 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2019-01-12 22:19:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:09,125 INFO L225 Difference]: With dead ends: 29908 [2019-01-12 22:19:09,125 INFO L226 Difference]: Without dead ends: 29119 [2019-01-12 22:19:09,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-01-12 22:19:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29119 states. [2019-01-12 22:19:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29119 to 23329. [2019-01-12 22:19:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23329 states. [2019-01-12 22:19:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23329 states to 23329 states and 95602 transitions. [2019-01-12 22:19:09,640 INFO L78 Accepts]: Start accepts. Automaton has 23329 states and 95602 transitions. Word has length 49 [2019-01-12 22:19:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:09,640 INFO L480 AbstractCegarLoop]: Abstraction has 23329 states and 95602 transitions. [2019-01-12 22:19:09,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 22:19:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 23329 states and 95602 transitions. [2019-01-12 22:19:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:19:09,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:09,658 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] [2019-01-12 22:19:09,658 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:09,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1728037470, now seen corresponding path program 4 times [2019-01-12 22:19:09,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:09,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:09,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:09,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-12 22:19:10,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 22:19:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 22:19:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-01-12 22:19:10,382 INFO L87 Difference]: Start difference. First operand 23329 states and 95602 transitions. Second operand 16 states. [2019-01-12 22:19:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:11,247 INFO L93 Difference]: Finished difference Result 33290 states and 134192 transitions. [2019-01-12 22:19:11,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 22:19:11,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-01-12 22:19:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:11,333 INFO L225 Difference]: With dead ends: 33290 [2019-01-12 22:19:11,333 INFO L226 Difference]: Without dead ends: 32456 [2019-01-12 22:19:11,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-01-12 22:19:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32456 states. [2019-01-12 22:19:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32456 to 23122. [2019-01-12 22:19:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23122 states. [2019-01-12 22:19:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23122 states to 23122 states and 94845 transitions. [2019-01-12 22:19:11,882 INFO L78 Accepts]: Start accepts. Automaton has 23122 states and 94845 transitions. Word has length 49 [2019-01-12 22:19:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:11,883 INFO L480 AbstractCegarLoop]: Abstraction has 23122 states and 94845 transitions. [2019-01-12 22:19:11,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 22:19:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 23122 states and 94845 transitions. [2019-01-12 22:19:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 22:19:11,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:11,903 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] [2019-01-12 22:19:11,903 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2105891278, now seen corresponding path program 1 times [2019-01-12 22:19:11,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:11,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:11,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:11,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:11,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:12,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:12,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:19:12,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:19:12,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:19:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:19:12,090 INFO L87 Difference]: Start difference. First operand 23122 states and 94845 transitions. Second operand 10 states. [2019-01-12 22:19:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:12,722 INFO L93 Difference]: Finished difference Result 33206 states and 132204 transitions. [2019-01-12 22:19:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 22:19:12,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-01-12 22:19:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:12,791 INFO L225 Difference]: With dead ends: 33206 [2019-01-12 22:19:12,791 INFO L226 Difference]: Without dead ends: 26143 [2019-01-12 22:19:12,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:19:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26143 states. [2019-01-12 22:19:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26143 to 20399. [2019-01-12 22:19:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20399 states. [2019-01-12 22:19:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20399 states to 20399 states and 83215 transitions. [2019-01-12 22:19:13,257 INFO L78 Accepts]: Start accepts. Automaton has 20399 states and 83215 transitions. Word has length 49 [2019-01-12 22:19:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:13,258 INFO L480 AbstractCegarLoop]: Abstraction has 20399 states and 83215 transitions. [2019-01-12 22:19:13,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:19:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 20399 states and 83215 transitions. [2019-01-12 22:19:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 22:19:13,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:13,279 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] [2019-01-12 22:19:13,280 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1659149151, now seen corresponding path program 1 times [2019-01-12 22:19:13,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:13,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:13,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:13,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:13,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:14,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:14,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:19:14,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:19:14,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:19:14,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:19:14,243 INFO L87 Difference]: Start difference. First operand 20399 states and 83215 transitions. Second operand 18 states. [2019-01-12 22:19:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:15,550 INFO L93 Difference]: Finished difference Result 27038 states and 108725 transitions. [2019-01-12 22:19:15,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 22:19:15,551 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2019-01-12 22:19:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:15,621 INFO L225 Difference]: With dead ends: 27038 [2019-01-12 22:19:15,621 INFO L226 Difference]: Without dead ends: 26669 [2019-01-12 22:19:15,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2019-01-12 22:19:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26669 states. [2019-01-12 22:19:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26669 to 20090. [2019-01-12 22:19:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20090 states. [2019-01-12 22:19:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 82205 transitions. [2019-01-12 22:19:16,084 INFO L78 Accepts]: Start accepts. Automaton has 20090 states and 82205 transitions. Word has length 51 [2019-01-12 22:19:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:16,084 INFO L480 AbstractCegarLoop]: Abstraction has 20090 states and 82205 transitions. [2019-01-12 22:19:16,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:19:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 20090 states and 82205 transitions. [2019-01-12 22:19:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 22:19:16,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:16,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, 1, 1] [2019-01-12 22:19:16,105 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1841104979, now seen corresponding path program 1 times [2019-01-12 22:19:16,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:16,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:16,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:16,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:16,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:19:16,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:19:16,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:19:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:19:16,873 INFO L87 Difference]: Start difference. First operand 20090 states and 82205 transitions. Second operand 18 states. [2019-01-12 22:19:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:18,339 INFO L93 Difference]: Finished difference Result 26099 states and 105749 transitions. [2019-01-12 22:19:18,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 22:19:18,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2019-01-12 22:19:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:18,406 INFO L225 Difference]: With dead ends: 26099 [2019-01-12 22:19:18,407 INFO L226 Difference]: Without dead ends: 25550 [2019-01-12 22:19:18,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2019-01-12 22:19:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25550 states. [2019-01-12 22:19:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25550 to 20034. [2019-01-12 22:19:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20034 states. [2019-01-12 22:19:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 81977 transitions. [2019-01-12 22:19:19,085 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 81977 transitions. Word has length 51 [2019-01-12 22:19:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:19,086 INFO L480 AbstractCegarLoop]: Abstraction has 20034 states and 81977 transitions. [2019-01-12 22:19:19,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:19:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 81977 transitions. [2019-01-12 22:19:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 22:19:19,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:19,107 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] [2019-01-12 22:19:19,107 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1358794663, now seen corresponding path program 2 times [2019-01-12 22:19:19,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:19,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:19,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:19,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:20,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:20,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-12 22:19:20,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 22:19:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 22:19:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-01-12 22:19:20,148 INFO L87 Difference]: Start difference. First operand 20034 states and 81977 transitions. Second operand 21 states. [2019-01-12 22:19:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:21,911 INFO L93 Difference]: Finished difference Result 20248 states and 81696 transitions. [2019-01-12 22:19:21,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 22:19:21,913 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2019-01-12 22:19:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:21,959 INFO L225 Difference]: With dead ends: 20248 [2019-01-12 22:19:21,959 INFO L226 Difference]: Without dead ends: 18421 [2019-01-12 22:19:21,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 22:19:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2019-01-12 22:19:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 12961. [2019-01-12 22:19:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12961 states. [2019-01-12 22:19:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 52686 transitions. [2019-01-12 22:19:22,262 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 52686 transitions. Word has length 51 [2019-01-12 22:19:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:22,262 INFO L480 AbstractCegarLoop]: Abstraction has 12961 states and 52686 transitions. [2019-01-12 22:19:22,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 22:19:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 52686 transitions. [2019-01-12 22:19:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 22:19:22,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:22,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:19:22,278 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:22,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1212252299, now seen corresponding path program 1 times [2019-01-12 22:19:22,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:22,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:22,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:22,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:22,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 22:19:22,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 22:19:22,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 22:19:22,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 22:19:22,886 INFO L87 Difference]: Start difference. First operand 12961 states and 52686 transitions. Second operand 7 states. [2019-01-12 22:19:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:23,251 INFO L93 Difference]: Finished difference Result 15953 states and 62985 transitions. [2019-01-12 22:19:23,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:19:23,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-01-12 22:19:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:23,293 INFO L225 Difference]: With dead ends: 15953 [2019-01-12 22:19:23,293 INFO L226 Difference]: Without dead ends: 15233 [2019-01-12 22:19:23,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-12 22:19:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2019-01-12 22:19:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 14813. [2019-01-12 22:19:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14813 states. [2019-01-12 22:19:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14813 states to 14813 states and 59388 transitions. [2019-01-12 22:19:23,574 INFO L78 Accepts]: Start accepts. Automaton has 14813 states and 59388 transitions. Word has length 52 [2019-01-12 22:19:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:23,575 INFO L480 AbstractCegarLoop]: Abstraction has 14813 states and 59388 transitions. [2019-01-12 22:19:23,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 22:19:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 14813 states and 59388 transitions. [2019-01-12 22:19:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 22:19:23,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:23,590 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] [2019-01-12 22:19:23,590 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash -602885373, now seen corresponding path program 2 times [2019-01-12 22:19:23,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:23,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:23,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:23,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:23,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:24,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:24,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-12 22:19:24,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 22:19:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 22:19:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-01-12 22:19:24,525 INFO L87 Difference]: Start difference. First operand 14813 states and 59388 transitions. Second operand 21 states. [2019-01-12 22:19:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:25,995 INFO L93 Difference]: Finished difference Result 17609 states and 69125 transitions. [2019-01-12 22:19:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 22:19:26,002 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2019-01-12 22:19:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:26,037 INFO L225 Difference]: With dead ends: 17609 [2019-01-12 22:19:26,037 INFO L226 Difference]: Without dead ends: 15449 [2019-01-12 22:19:26,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 22:19:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15449 states. [2019-01-12 22:19:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15449 to 13373. [2019-01-12 22:19:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13373 states. [2019-01-12 22:19:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13373 states to 13373 states and 53076 transitions. [2019-01-12 22:19:26,305 INFO L78 Accepts]: Start accepts. Automaton has 13373 states and 53076 transitions. Word has length 52 [2019-01-12 22:19:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:26,305 INFO L480 AbstractCegarLoop]: Abstraction has 13373 states and 53076 transitions. [2019-01-12 22:19:26,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 22:19:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 13373 states and 53076 transitions. [2019-01-12 22:19:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 22:19:26,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:26,320 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] [2019-01-12 22:19:26,320 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash -645490969, now seen corresponding path program 3 times [2019-01-12 22:19:26,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:26,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:27,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:27,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-01-12 22:19:27,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 22:19:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 22:19:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-01-12 22:19:27,113 INFO L87 Difference]: Start difference. First operand 13373 states and 53076 transitions. Second operand 18 states. [2019-01-12 22:19:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:28,118 INFO L93 Difference]: Finished difference Result 19310 states and 73665 transitions. [2019-01-12 22:19:28,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 22:19:28,119 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-01-12 22:19:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:28,161 INFO L225 Difference]: With dead ends: 19310 [2019-01-12 22:19:28,162 INFO L226 Difference]: Without dead ends: 18590 [2019-01-12 22:19:28,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-01-12 22:19:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18590 states. [2019-01-12 22:19:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18590 to 12634. [2019-01-12 22:19:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12634 states. [2019-01-12 22:19:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12634 states to 12634 states and 50125 transitions. [2019-01-12 22:19:28,437 INFO L78 Accepts]: Start accepts. Automaton has 12634 states and 50125 transitions. Word has length 52 [2019-01-12 22:19:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:28,438 INFO L480 AbstractCegarLoop]: Abstraction has 12634 states and 50125 transitions. [2019-01-12 22:19:28,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 22:19:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 12634 states and 50125 transitions. [2019-01-12 22:19:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 22:19:28,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:28,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:19:28,454 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1387947128, now seen corresponding path program 1 times [2019-01-12 22:19:28,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:28,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:28,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 22:19:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:29,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:29,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-12 22:19:29,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 22:19:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 22:19:29,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-01-12 22:19:29,500 INFO L87 Difference]: Start difference. First operand 12634 states and 50125 transitions. Second operand 20 states. [2019-01-12 22:19:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:31,497 INFO L93 Difference]: Finished difference Result 11254 states and 43666 transitions. [2019-01-12 22:19:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 22:19:31,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-01-12 22:19:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:31,530 INFO L225 Difference]: With dead ends: 11254 [2019-01-12 22:19:31,530 INFO L226 Difference]: Without dead ends: 10678 [2019-01-12 22:19:31,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 22:19:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10678 states. [2019-01-12 22:19:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10678 to 6913. [2019-01-12 22:19:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2019-01-12 22:19:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 28314 transitions. [2019-01-12 22:19:31,695 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 28314 transitions. Word has length 54 [2019-01-12 22:19:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:31,695 INFO L480 AbstractCegarLoop]: Abstraction has 6913 states and 28314 transitions. [2019-01-12 22:19:31,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 22:19:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 28314 transitions. [2019-01-12 22:19:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 22:19:31,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:31,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 22:19:31,707 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:31,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1419143174, now seen corresponding path program 1 times [2019-01-12 22:19:31,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:31,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:31,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:31,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:31,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 22:19:31,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 22:19:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 22:19:31,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 22:19:31,835 INFO L87 Difference]: Start difference. First operand 6913 states and 28314 transitions. Second operand 8 states. [2019-01-12 22:19:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:32,056 INFO L93 Difference]: Finished difference Result 6913 states and 28308 transitions. [2019-01-12 22:19:32,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:19:32,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-01-12 22:19:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:32,075 INFO L225 Difference]: With dead ends: 6913 [2019-01-12 22:19:32,075 INFO L226 Difference]: Without dead ends: 6868 [2019-01-12 22:19:32,076 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 [2019-01-12 22:19:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2019-01-12 22:19:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2019-01-12 22:19:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6868 states. [2019-01-12 22:19:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 28122 transitions. [2019-01-12 22:19:32,198 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 28122 transitions. Word has length 87 [2019-01-12 22:19:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:32,199 INFO L480 AbstractCegarLoop]: Abstraction has 6868 states and 28122 transitions. [2019-01-12 22:19:32,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 22:19:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 28122 transitions. [2019-01-12 22:19:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 22:19:32,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:32,210 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] [2019-01-12 22:19:32,211 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:32,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1718811831, now seen corresponding path program 1 times [2019-01-12 22:19:32,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:32,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:32,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:32,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:32,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:32,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:32,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 22:19:32,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 22:19:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 22:19:32,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 22:19:32,362 INFO L87 Difference]: Start difference. First operand 6868 states and 28122 transitions. Second operand 9 states. [2019-01-12 22:19:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:32,587 INFO L93 Difference]: Finished difference Result 6868 states and 28116 transitions. [2019-01-12 22:19:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 22:19:32,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-01-12 22:19:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:32,606 INFO L225 Difference]: With dead ends: 6868 [2019-01-12 22:19:32,606 INFO L226 Difference]: Without dead ends: 6670 [2019-01-12 22:19:32,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-01-12 22:19:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2019-01-12 22:19:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2019-01-12 22:19:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2019-01-12 22:19:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27300 transitions. [2019-01-12 22:19:32,728 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27300 transitions. Word has length 87 [2019-01-12 22:19:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:32,729 INFO L480 AbstractCegarLoop]: Abstraction has 6670 states and 27300 transitions. [2019-01-12 22:19:32,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 22:19:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27300 transitions. [2019-01-12 22:19:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 22:19:32,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:32,740 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] [2019-01-12 22:19:32,741 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:32,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1751030460, now seen corresponding path program 1 times [2019-01-12 22:19:32,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:32,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:32,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 22:19:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 22:19:32,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 22:19:32,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 22:19:32,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 22:19:32,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 22:19:32,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 22:19:32,982 INFO L87 Difference]: Start difference. First operand 6670 states and 27300 transitions. Second operand 10 states. [2019-01-12 22:19:33,365 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2019-01-12 22:19:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 22:19:33,474 INFO L93 Difference]: Finished difference Result 6670 states and 27264 transitions. [2019-01-12 22:19:33,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 22:19:33,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-01-12 22:19:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 22:19:33,493 INFO L225 Difference]: With dead ends: 6670 [2019-01-12 22:19:33,493 INFO L226 Difference]: Without dead ends: 6328 [2019-01-12 22:19:33,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-12 22:19:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2019-01-12 22:19:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 6328. [2019-01-12 22:19:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2019-01-12 22:19:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 25848 transitions. [2019-01-12 22:19:33,606 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 25848 transitions. Word has length 87 [2019-01-12 22:19:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 22:19:33,607 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 25848 transitions. [2019-01-12 22:19:33,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 22:19:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 25848 transitions. [2019-01-12 22:19:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 22:19:33,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 22:19:33,618 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] [2019-01-12 22:19:33,618 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 22:19:33,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 22:19:33,619 INFO L82 PathProgramCache]: Analyzing trace with hash -890166646, now seen corresponding path program 1 times [2019-01-12 22:19:33,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 22:19:33,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 22:19:33,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:33,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 22:19:33,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 22:19:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:19:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 22:19:33,704 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 22:19:33,878 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 22:19:33,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:19:33 BasicIcfg [2019-01-12 22:19:33,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 22:19:33,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 22:19:33,883 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 22:19:33,883 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 22:19:33,884 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:17:56" (3/4) ... [2019-01-12 22:19:33,889 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 22:19:34,046 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 22:19:34,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 22:19:34,048 INFO L168 Benchmark]: Toolchain (without parser) took 99187.82 ms. Allocated memory was 1.0 GB in the beginning and 5.2 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.4 GB). Peak memory consumption was 784.4 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:34,049 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-12 22:19:34,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1208.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:34,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:34,051 INFO L168 Benchmark]: Boogie Preprocessor took 33.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 22:19:34,051 INFO L168 Benchmark]: RCFGBuilder took 736.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:34,053 INFO L168 Benchmark]: TraceAbstraction took 96964.61 ms. Allocated memory was 1.1 GB in the beginning and 5.2 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 679.3 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:34,054 INFO L168 Benchmark]: Witness Printer took 164.24 ms. Allocated memory is still 5.2 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2019-01-12 22:19:34,059 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.16 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 1208.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 736.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96964.61 ms. Allocated memory was 1.1 GB in the beginning and 5.2 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 679.3 MB. Max. memory is 11.5 GB. * Witness Printer took 164.24 ms. Allocated memory is still 5.2 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. 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}] [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}] [L1248] -1 \read(t) 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}] [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}, 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}, \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, 96.2s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 44.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5918 SDtfs, 15081 SDslu, 31414 SDs, 0 SdLazy, 13871 SolverSat, 1724 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 661 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 29.9s 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: 27.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 192976 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 1653 NumberOfCodeBlocks, 1653 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1535 ConstructedInterpolants, 0 QuantifiedInterpolants, 1140426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...