java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:58:34,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:58:34,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:58:34,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:58:34,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:58:34,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:58:34,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:58:34,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:58:34,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:58:34,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:58:34,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:58:34,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:58:34,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:58:34,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:58:34,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:58:34,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:58:34,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:58:34,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:58:34,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:58:34,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:58:34,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:58:34,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:58:34,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:58:34,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:58:34,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:58:34,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:58:34,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:58:34,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:58:34,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:58:34,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:58:34,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:58:34,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:58:34,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:58:34,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:58:34,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:58:34,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:58:34,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:58:34,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:58:34,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:58:34,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:58:34,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:58:34,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 21:58:34,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:58:34,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:58:34,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:58:34,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:58:34,841 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:58:34,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:58:34,842 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:58:34,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:58:34,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:58:34,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:58:34,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:58:34,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:58:34,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:58:34,844 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:58:34,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:58:34,845 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:58:34,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:58:34,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:58:34,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:58:34,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:58:34,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:58:34,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:58:34,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:58:34,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:58:34,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:58:34,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:58:34,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:58:34,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:58:34,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:58:34,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:58:34,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:58:34,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:58:34,913 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:58:34,913 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:58:34,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label41.c [2019-09-07 21:58:34,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aab8d385/88235c1db0d642e39ebb096b6378b19e/FLAGf89f90e56 [2019-09-07 21:58:35,660 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:58:35,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label41.c [2019-09-07 21:58:35,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aab8d385/88235c1db0d642e39ebb096b6378b19e/FLAGf89f90e56 [2019-09-07 21:58:35,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aab8d385/88235c1db0d642e39ebb096b6378b19e [2019-09-07 21:58:35,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:58:35,806 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:58:35,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:58:35,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:58:35,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:58:35,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:58:35" (1/1) ... [2019-09-07 21:58:35,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74acbc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:35, skipping insertion in model container [2019-09-07 21:58:35,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:58:35" (1/1) ... [2019-09-07 21:58:35,819 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:58:35,923 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:58:37,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:58:37,126 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:58:37,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:58:37,480 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:58:37,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37 WrapperNode [2019-09-07 21:58:37,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:58:37,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:58:37,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:58:37,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:58:37,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (1/1) ... [2019-09-07 21:58:37,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (1/1) ... [2019-09-07 21:58:37,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (1/1) ... [2019-09-07 21:58:37,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (1/1) ... [2019-09-07 21:58:37,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (1/1) ... [2019-09-07 21:58:37,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (1/1) ... [2019-09-07 21:58:37,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (1/1) ... [2019-09-07 21:58:37,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:58:37,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:58:37,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:58:37,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:58:37,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (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-09-07 21:58:37,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:58:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:58:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:58:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:58:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:58:37,945 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:58:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:58:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:58:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:58:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:58:37,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:58:37,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:58:37,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:58:42,150 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:58:42,150 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:58:42,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:58:42 BoogieIcfgContainer [2019-09-07 21:58:42,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:58:42,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:58:42,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:58:42,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:58:42,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:58:35" (1/3) ... [2019-09-07 21:58:42,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6107b732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:58:42, skipping insertion in model container [2019-09-07 21:58:42,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:58:37" (2/3) ... [2019-09-07 21:58:42,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6107b732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:58:42, skipping insertion in model container [2019-09-07 21:58:42,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:58:42" (3/3) ... [2019-09-07 21:58:42,161 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label41.c [2019-09-07 21:58:42,174 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:58:42,184 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:58:42,206 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:58:42,249 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:58:42,250 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:58:42,251 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:58:42,251 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:58:42,251 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:58:42,251 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:58:42,251 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:58:42,252 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:58:42,252 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:58:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:58:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 21:58:42,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:58:42,295 INFO L399 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] [2019-09-07 21:58:42,297 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:58:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:58:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1810198175, now seen corresponding path program 1 times [2019-09-07 21:58:42,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:58:42,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:58:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:58:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:58:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:58:42,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:58:42,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:58:42,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:58:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:58:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:58:42,625 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:58:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:58:48,274 INFO L93 Difference]: Finished difference Result 2162 states and 4009 transitions. [2019-09-07 21:58:48,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:58:48,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-09-07 21:58:48,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:58:48,305 INFO L225 Difference]: With dead ends: 2162 [2019-09-07 21:58:48,306 INFO L226 Difference]: Without dead ends: 1478 [2019-09-07 21:58:48,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:58:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2019-09-07 21:58:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1006. [2019-09-07 21:58:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-09-07 21:58:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1697 transitions. [2019-09-07 21:58:48,440 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1697 transitions. Word has length 40 [2019-09-07 21:58:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:58:48,442 INFO L475 AbstractCegarLoop]: Abstraction has 1006 states and 1697 transitions. [2019-09-07 21:58:48,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:58:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1697 transitions. [2019-09-07 21:58:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 21:58:48,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:58:48,452 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:58:48,453 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:58:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:58:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash 783785860, now seen corresponding path program 1 times [2019-09-07 21:58:48,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:58:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:58:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:48,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:58:48,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:58:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:58:48,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:58:48,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:58:48,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:58:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:58:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:58:48,766 INFO L87 Difference]: Start difference. First operand 1006 states and 1697 transitions. Second operand 6 states. [2019-09-07 21:58:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:58:52,819 INFO L93 Difference]: Finished difference Result 2931 states and 5018 transitions. [2019-09-07 21:58:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:58:52,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-09-07 21:58:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:58:52,852 INFO L225 Difference]: With dead ends: 2931 [2019-09-07 21:58:52,852 INFO L226 Difference]: Without dead ends: 1931 [2019-09-07 21:58:52,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:58:52,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2019-09-07 21:58:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1911. [2019-09-07 21:58:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2019-09-07 21:58:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2935 transitions. [2019-09-07 21:58:52,943 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2935 transitions. Word has length 115 [2019-09-07 21:58:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:58:52,945 INFO L475 AbstractCegarLoop]: Abstraction has 1911 states and 2935 transitions. [2019-09-07 21:58:52,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:58:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2935 transitions. [2019-09-07 21:58:52,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 21:58:52,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:58:52,955 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:58:52,955 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:58:52,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:58:52,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1437267844, now seen corresponding path program 1 times [2019-09-07 21:58:52,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:58:52,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:58:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:52,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:58:52,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:58:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:58:53,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:58:53,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:58:53,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:58:53,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:58:53,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:58:53,161 INFO L87 Difference]: Start difference. First operand 1911 states and 2935 transitions. Second operand 6 states. [2019-09-07 21:58:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:58:57,117 INFO L93 Difference]: Finished difference Result 4746 states and 7234 transitions. [2019-09-07 21:58:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:58:57,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-07 21:58:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:58:57,133 INFO L225 Difference]: With dead ends: 4746 [2019-09-07 21:58:57,134 INFO L226 Difference]: Without dead ends: 2841 [2019-09-07 21:58:57,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:58:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2019-09-07 21:58:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2819. [2019-09-07 21:58:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2019-09-07 21:58:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3606 transitions. [2019-09-07 21:58:57,234 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3606 transitions. Word has length 119 [2019-09-07 21:58:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:58:57,243 INFO L475 AbstractCegarLoop]: Abstraction has 2819 states and 3606 transitions. [2019-09-07 21:58:57,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:58:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3606 transitions. [2019-09-07 21:58:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 21:58:57,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:58:57,246 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:58:57,246 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:58:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:58:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash -495366055, now seen corresponding path program 1 times [2019-09-07 21:58:57,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:58:57,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:58:57,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:57,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:58:57,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:58:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:58:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:58:57,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:58:57,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:58:57,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:58:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:58:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:58:57,394 INFO L87 Difference]: Start difference. First operand 2819 states and 3606 transitions. Second operand 4 states. [2019-09-07 21:59:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:59:01,038 INFO L93 Difference]: Finished difference Result 5632 states and 7217 transitions. [2019-09-07 21:59:01,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:59:01,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-07 21:59:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:59:01,060 INFO L225 Difference]: With dead ends: 5632 [2019-09-07 21:59:01,060 INFO L226 Difference]: Without dead ends: 2819 [2019-09-07 21:59:01,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:59:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2019-09-07 21:59:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2819. [2019-09-07 21:59:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2019-09-07 21:59:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3569 transitions. [2019-09-07 21:59:01,138 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3569 transitions. Word has length 149 [2019-09-07 21:59:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:59:01,139 INFO L475 AbstractCegarLoop]: Abstraction has 2819 states and 3569 transitions. [2019-09-07 21:59:01,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:59:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3569 transitions. [2019-09-07 21:59:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-07 21:59:01,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:59:01,143 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:59:01,143 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:59:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:59:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1406460647, now seen corresponding path program 1 times [2019-09-07 21:59:01,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:59:01,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:59:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:01,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:01,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 21:59:01,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:59:01,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:59:01,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:59:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:59:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:59:01,347 INFO L87 Difference]: Start difference. First operand 2819 states and 3569 transitions. Second operand 3 states. [2019-09-07 21:59:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:59:04,298 INFO L93 Difference]: Finished difference Result 8271 states and 10619 transitions. [2019-09-07 21:59:04,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:59:04,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-07 21:59:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:59:04,325 INFO L225 Difference]: With dead ends: 8271 [2019-09-07 21:59:04,326 INFO L226 Difference]: Without dead ends: 5458 [2019-09-07 21:59:04,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:59:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2019-09-07 21:59:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 5458. [2019-09-07 21:59:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5458 states. [2019-09-07 21:59:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5458 states to 5458 states and 6489 transitions. [2019-09-07 21:59:04,442 INFO L78 Accepts]: Start accepts. Automaton has 5458 states and 6489 transitions. Word has length 202 [2019-09-07 21:59:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:59:04,443 INFO L475 AbstractCegarLoop]: Abstraction has 5458 states and 6489 transitions. [2019-09-07 21:59:04,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:59:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5458 states and 6489 transitions. [2019-09-07 21:59:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-07 21:59:04,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:59:04,447 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:59:04,448 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:59:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:59:04,448 INFO L82 PathProgramCache]: Analyzing trace with hash 326422220, now seen corresponding path program 1 times [2019-09-07 21:59:04,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:59:04,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:59:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:04,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 21:59:04,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:59:04,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:59:04,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:59:04,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:59:04,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:59:04,594 INFO L87 Difference]: Start difference. First operand 5458 states and 6489 transitions. Second operand 4 states. [2019-09-07 21:59:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:59:09,955 INFO L93 Difference]: Finished difference Result 16240 states and 20164 transitions. [2019-09-07 21:59:09,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:59:09,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-07 21:59:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:59:09,998 INFO L225 Difference]: With dead ends: 16240 [2019-09-07 21:59:09,998 INFO L226 Difference]: Without dead ends: 10788 [2019-09-07 21:59:10,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:59:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10788 states. [2019-09-07 21:59:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10788 to 9917. [2019-09-07 21:59:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9917 states. [2019-09-07 21:59:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9917 states to 9917 states and 11853 transitions. [2019-09-07 21:59:10,241 INFO L78 Accepts]: Start accepts. Automaton has 9917 states and 11853 transitions. Word has length 225 [2019-09-07 21:59:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:59:10,241 INFO L475 AbstractCegarLoop]: Abstraction has 9917 states and 11853 transitions. [2019-09-07 21:59:10,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:59:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 9917 states and 11853 transitions. [2019-09-07 21:59:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-07 21:59:10,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:59:10,250 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:59:10,250 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:59:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:59:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1511203216, now seen corresponding path program 1 times [2019-09-07 21:59:10,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:59:10,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:59:10,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:10,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 107 proven. 142 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 21:59:10,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:59:10,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:59:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:59:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:10,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 21:59:10,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:59:10,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:59:10,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:59:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 21:59:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:59:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-07 21:59:10,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:59:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:59:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:59:10,960 INFO L87 Difference]: Start difference. First operand 9917 states and 11853 transitions. Second operand 10 states. [2019-09-07 21:59:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:59:25,373 INFO L93 Difference]: Finished difference Result 35338 states and 43963 transitions. [2019-09-07 21:59:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:59:25,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 276 [2019-09-07 21:59:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:59:25,492 INFO L225 Difference]: With dead ends: 35338 [2019-09-07 21:59:25,492 INFO L226 Difference]: Without dead ends: 25427 [2019-09-07 21:59:25,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:59:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25427 states. [2019-09-07 21:59:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25427 to 18640. [2019-09-07 21:59:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18640 states. [2019-09-07 21:59:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18640 states to 18640 states and 22743 transitions. [2019-09-07 21:59:26,049 INFO L78 Accepts]: Start accepts. Automaton has 18640 states and 22743 transitions. Word has length 276 [2019-09-07 21:59:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:59:26,050 INFO L475 AbstractCegarLoop]: Abstraction has 18640 states and 22743 transitions. [2019-09-07 21:59:26,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:59:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 18640 states and 22743 transitions. [2019-09-07 21:59:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-07 21:59:26,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:59:26,058 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:59:26,058 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:59:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:59:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1731637693, now seen corresponding path program 1 times [2019-09-07 21:59:26,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:59:26,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:59:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:26,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 176 proven. 74 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 21:59:26,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:59:26,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:59:26,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:59:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:26,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:59:26,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:59:26,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:59:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-07 21:59:26,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:59:26,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 21:59:26,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:59:26,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:59:26,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:59:26,827 INFO L87 Difference]: Start difference. First operand 18640 states and 22743 transitions. Second operand 9 states. [2019-09-07 21:59:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:59:38,104 INFO L93 Difference]: Finished difference Result 45623 states and 56857 transitions. [2019-09-07 21:59:38,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 21:59:38,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 298 [2019-09-07 21:59:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:59:38,204 INFO L225 Difference]: With dead ends: 45623 [2019-09-07 21:59:38,204 INFO L226 Difference]: Without dead ends: 26989 [2019-09-07 21:59:38,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2019-09-07 21:59:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26989 states. [2019-09-07 21:59:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26989 to 25463. [2019-09-07 21:59:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25463 states. [2019-09-07 21:59:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25463 states to 25463 states and 31495 transitions. [2019-09-07 21:59:39,708 INFO L78 Accepts]: Start accepts. Automaton has 25463 states and 31495 transitions. Word has length 298 [2019-09-07 21:59:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:59:39,709 INFO L475 AbstractCegarLoop]: Abstraction has 25463 states and 31495 transitions. [2019-09-07 21:59:39,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:59:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 25463 states and 31495 transitions. [2019-09-07 21:59:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-07 21:59:39,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:59:39,726 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:59:39,726 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:59:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:59:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -111244175, now seen corresponding path program 1 times [2019-09-07 21:59:39,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:59:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:59:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 117 proven. 166 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 21:59:41,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:59:41,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:59:41,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:59:41,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:59:41,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:59:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-09-07 21:59:41,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:59:41,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-07 21:59:41,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 21:59:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 21:59:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:59:41,400 INFO L87 Difference]: Start difference. First operand 25463 states and 31495 transitions. Second operand 13 states. [2019-09-07 21:59:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:59:58,436 INFO L93 Difference]: Finished difference Result 77799 states and 98532 transitions. [2019-09-07 21:59:58,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 21:59:58,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 382 [2019-09-07 21:59:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:59:58,594 INFO L225 Difference]: With dead ends: 77799 [2019-09-07 21:59:58,594 INFO L226 Difference]: Without dead ends: 49916 [2019-09-07 21:59:58,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 413 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=501, Invalid=1851, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 21:59:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49916 states. [2019-09-07 21:59:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49916 to 44037. [2019-09-07 21:59:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44037 states. [2019-09-07 21:59:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44037 states to 44037 states and 51217 transitions. [2019-09-07 21:59:59,644 INFO L78 Accepts]: Start accepts. Automaton has 44037 states and 51217 transitions. Word has length 382 [2019-09-07 21:59:59,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:59:59,644 INFO L475 AbstractCegarLoop]: Abstraction has 44037 states and 51217 transitions. [2019-09-07 21:59:59,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 21:59:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 44037 states and 51217 transitions. [2019-09-07 21:59:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-09-07 21:59:59,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:59:59,664 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:59:59,664 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:59:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:59:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1498634395, now seen corresponding path program 1 times [2019-09-07 21:59:59,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:59:59,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:59:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:59,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:59:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:59:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:00:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 262 proven. 223 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-09-07 22:00:00,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:00:00,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:00:00,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:00:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:00:00,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:00:00,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:00:00,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:00:00,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:00:06,306 WARN L188 SmtUtils]: Spent 6.05 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 22:00:06,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:00:07,076 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-09-07 22:00:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 554 proven. 66 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-09-07 22:00:07,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:00:07,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-07 22:00:07,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:00:07,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:00:07,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:00:07,573 INFO L87 Difference]: Start difference. First operand 44037 states and 51217 transitions. Second operand 9 states. [2019-09-07 22:00:30,218 WARN L188 SmtUtils]: Spent 20.17 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-07 22:00:59,033 WARN L188 SmtUtils]: Spent 18.20 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-07 22:01:14,569 WARN L188 SmtUtils]: Spent 12.09 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-07 22:01:38,599 WARN L188 SmtUtils]: Spent 22.13 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-07 22:02:03,350 WARN L188 SmtUtils]: Spent 22.20 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-07 22:02:25,655 WARN L188 SmtUtils]: Spent 18.20 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-07 22:02:48,486 WARN L188 SmtUtils]: Spent 22.17 s on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-09-07 22:03:03,135 WARN L188 SmtUtils]: Spent 12.12 s on a formula simplification that was a NOOP. DAG size: 40 [2019-09-07 22:03:19,646 WARN L188 SmtUtils]: Spent 14.13 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-07 22:03:25,721 WARN L188 SmtUtils]: Spent 6.05 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-07 22:03:44,384 WARN L188 SmtUtils]: Spent 18.21 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-07 22:03:50,703 WARN L188 SmtUtils]: Spent 6.30 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-07 22:03:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:03:51,709 INFO L93 Difference]: Finished difference Result 173254 states and 206812 transitions. [2019-09-07 22:03:51,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 22:03:51,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 461 [2019-09-07 22:03:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:03:52,020 INFO L225 Difference]: With dead ends: 173254 [2019-09-07 22:03:52,020 INFO L226 Difference]: Without dead ends: 116517 [2019-09-07 22:03:52,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 495 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 199.3s TimeCoverageRelationStatistics Valid=477, Invalid=2175, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 22:03:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116517 states. [2019-09-07 22:03:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116517 to 100210. [2019-09-07 22:03:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100210 states. [2019-09-07 22:03:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100210 states to 100210 states and 115741 transitions. [2019-09-07 22:03:56,226 INFO L78 Accepts]: Start accepts. Automaton has 100210 states and 115741 transitions. Word has length 461 [2019-09-07 22:03:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:03:56,227 INFO L475 AbstractCegarLoop]: Abstraction has 100210 states and 115741 transitions. [2019-09-07 22:03:56,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:03:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 100210 states and 115741 transitions. [2019-09-07 22:03:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-09-07 22:03:56,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:03:56,257 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 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-09-07 22:03:56,257 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:03:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:03:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1109444103, now seen corresponding path program 1 times [2019-09-07 22:03:56,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:03:56,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:03:56,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:03:56,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:03:56,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:03:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:03:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 355 proven. 147 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-09-07 22:03:56,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:03:56,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:03:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:03:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:03:56,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:03:56,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:03:56,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:03:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-09-07 22:03:57,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:03:57,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 22:03:57,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:03:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:03:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:03:57,095 INFO L87 Difference]: Start difference. First operand 100210 states and 115741 transitions. Second operand 6 states. [2019-09-07 22:04:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:04:12,826 INFO L93 Difference]: Finished difference Result 257718 states and 301823 transitions. [2019-09-07 22:04:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 22:04:12,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 464 [2019-09-07 22:04:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:04:13,238 INFO L225 Difference]: With dead ends: 257718 [2019-09-07 22:04:13,238 INFO L226 Difference]: Without dead ends: 144789 [2019-09-07 22:04:13,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:04:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144789 states. [2019-09-07 22:04:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144789 to 131295. [2019-09-07 22:04:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131295 states. [2019-09-07 22:04:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131295 states to 131295 states and 151542 transitions. [2019-09-07 22:04:15,418 INFO L78 Accepts]: Start accepts. Automaton has 131295 states and 151542 transitions. Word has length 464 [2019-09-07 22:04:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:04:15,419 INFO L475 AbstractCegarLoop]: Abstraction has 131295 states and 151542 transitions. [2019-09-07 22:04:15,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:04:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 131295 states and 151542 transitions. [2019-09-07 22:04:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-07 22:04:15,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:04:15,447 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:04:15,447 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:04:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:04:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash -470007414, now seen corresponding path program 1 times [2019-09-07 22:04:15,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:04:15,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:04:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:04:15,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:04:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:04:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:04:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 101 proven. 194 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-07 22:04:15,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:04:15,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:04:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:04:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:04:16,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 22:04:16,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:04:16,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:04:16,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:04:20,790 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-09-07 22:04:20,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:04:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 346 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 22:04:21,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:04:21,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 22:04:21,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:04:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:04:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:04:21,045 INFO L87 Difference]: Start difference. First operand 131295 states and 151542 transitions. Second operand 16 states. [2019-09-07 22:04:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:04:59,453 INFO L93 Difference]: Finished difference Result 384332 states and 485863 transitions. [2019-09-07 22:04:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 22:04:59,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 487 [2019-09-07 22:04:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:00,293 INFO L225 Difference]: With dead ends: 384332 [2019-09-07 22:05:00,293 INFO L226 Difference]: Without dead ends: 250787 [2019-09-07 22:05:00,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3136 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1203, Invalid=7727, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 22:05:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250787 states. [2019-09-07 22:05:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250787 to 238669. [2019-09-07 22:05:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238669 states. [2019-09-07 22:05:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238669 states to 238669 states and 283075 transitions. [2019-09-07 22:05:03,725 INFO L78 Accepts]: Start accepts. Automaton has 238669 states and 283075 transitions. Word has length 487 [2019-09-07 22:05:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:03,725 INFO L475 AbstractCegarLoop]: Abstraction has 238669 states and 283075 transitions. [2019-09-07 22:05:03,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:05:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 238669 states and 283075 transitions. [2019-09-07 22:05:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-09-07 22:05:03,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:03,748 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:05:03,748 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1710614594, now seen corresponding path program 1 times [2019-09-07 22:05:03,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:03,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:03,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:03,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 309 proven. 32 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 22:05:04,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:05:04,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:05:04,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:04,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:05:04,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:05:04,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:05:04,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:04,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:05,862 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 114 DAG size of output: 25 [2019-09-07 22:05:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-07 22:05:06,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:05:06,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 22:05:06,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:05:06,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:05:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:05:06,147 INFO L87 Difference]: Start difference. First operand 238669 states and 283075 transitions. Second operand 8 states. [2019-09-07 22:05:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:20,874 INFO L93 Difference]: Finished difference Result 497118 states and 592969 transitions. [2019-09-07 22:05:20,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 22:05:20,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 530 [2019-09-07 22:05:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:21,621 INFO L225 Difference]: With dead ends: 497118 [2019-09-07 22:05:21,621 INFO L226 Difference]: Without dead ends: 260620 [2019-09-07 22:05:21,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:05:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260620 states. [2019-09-07 22:05:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260620 to 254346. [2019-09-07 22:05:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254346 states. [2019-09-07 22:05:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254346 states to 254346 states and 301160 transitions. [2019-09-07 22:05:25,100 INFO L78 Accepts]: Start accepts. Automaton has 254346 states and 301160 transitions. Word has length 530 [2019-09-07 22:05:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:25,101 INFO L475 AbstractCegarLoop]: Abstraction has 254346 states and 301160 transitions. [2019-09-07 22:05:25,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:05:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 254346 states and 301160 transitions. [2019-09-07 22:05:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2019-09-07 22:05:25,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:25,122 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:05:25,122 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash 759879709, now seen corresponding path program 1 times [2019-09-07 22:05:25,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:25,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:25,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 400 proven. 32 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-09-07 22:05:29,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:05:29,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:05:29,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:29,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:05:29,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:05:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 400 proven. 32 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-09-07 22:05:29,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:05:29,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 22:05:29,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:05:29,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:05:29,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:05:29,425 INFO L87 Difference]: Start difference. First operand 254346 states and 301160 transitions. Second operand 8 states. [2019-09-07 22:05:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:39,165 INFO L93 Difference]: Finished difference Result 573447 states and 680325 transitions. [2019-09-07 22:05:39,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:05:39,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 544 [2019-09-07 22:05:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:39,905 INFO L225 Difference]: With dead ends: 573447 [2019-09-07 22:05:39,905 INFO L226 Difference]: Without dead ends: 328412 [2019-09-07 22:05:40,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:05:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328412 states. [2019-09-07 22:05:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328412 to 310889. [2019-09-07 22:05:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310889 states. [2019-09-07 22:05:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310889 states to 310889 states and 363997 transitions. [2019-09-07 22:05:49,142 INFO L78 Accepts]: Start accepts. Automaton has 310889 states and 363997 transitions. Word has length 544 [2019-09-07 22:05:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:49,143 INFO L475 AbstractCegarLoop]: Abstraction has 310889 states and 363997 transitions. [2019-09-07 22:05:49,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:05:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 310889 states and 363997 transitions. [2019-09-07 22:05:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-07 22:05:49,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:49,166 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:05:49,166 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1447101911, now seen corresponding path program 1 times [2019-09-07 22:05:49,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:49,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:49,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 405 proven. 32 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 22:05:49,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:05:49,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:05:50,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:50,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:05:50,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:05:50,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:50,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 405 proven. 32 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 22:05:50,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:05:50,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-09-07 22:05:50,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:05:50,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:05:50,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:05:50,786 INFO L87 Difference]: Start difference. First operand 310889 states and 363997 transitions. Second operand 10 states. [2019-09-07 22:06:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:06,093 INFO L93 Difference]: Finished difference Result 675514 states and 787706 transitions. [2019-09-07 22:06:06,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:06:06,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 549 [2019-09-07 22:06:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:07,806 INFO L225 Difference]: With dead ends: 675514 [2019-09-07 22:06:07,806 INFO L226 Difference]: Without dead ends: 378504 [2019-09-07 22:06:08,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:06:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378504 states. [2019-09-07 22:06:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378504 to 365748. [2019-09-07 22:06:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365748 states. [2019-09-07 22:06:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365748 states to 365748 states and 425730 transitions. [2019-09-07 22:06:19,327 INFO L78 Accepts]: Start accepts. Automaton has 365748 states and 425730 transitions. Word has length 549 [2019-09-07 22:06:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:19,327 INFO L475 AbstractCegarLoop]: Abstraction has 365748 states and 425730 transitions. [2019-09-07 22:06:19,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:06:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 365748 states and 425730 transitions. [2019-09-07 22:06:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-09-07 22:06:19,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:19,352 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:06:19,353 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:19,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1136189516, now seen corresponding path program 1 times [2019-09-07 22:06:19,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:19,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:19,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 490 proven. 32 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 22:06:20,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:20,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:06:20,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:21,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:06:21,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 490 proven. 32 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 22:06:21,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:21,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 22:06:21,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:06:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:06:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:06:21,361 INFO L87 Difference]: Start difference. First operand 365748 states and 425730 transitions. Second operand 8 states. [2019-09-07 22:06:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:34,139 INFO L93 Difference]: Finished difference Result 770582 states and 893647 transitions. [2019-09-07 22:06:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:06:34,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 636 [2019-09-07 22:06:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:35,271 INFO L225 Difference]: With dead ends: 770582 [2019-09-07 22:06:35,271 INFO L226 Difference]: Without dead ends: 419259 [2019-09-07 22:06:35,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 643 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:06:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419259 states. [2019-09-07 22:06:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419259 to 405190. [2019-09-07 22:06:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405190 states. [2019-09-07 22:06:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405190 states to 405190 states and 469790 transitions. [2019-09-07 22:06:48,758 INFO L78 Accepts]: Start accepts. Automaton has 405190 states and 469790 transitions. Word has length 636 [2019-09-07 22:06:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:48,759 INFO L475 AbstractCegarLoop]: Abstraction has 405190 states and 469790 transitions. [2019-09-07 22:06:48,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:06:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 405190 states and 469790 transitions. [2019-09-07 22:06:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-09-07 22:06:48,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:48,812 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:06:48,812 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash -614971490, now seen corresponding path program 1 times [2019-09-07 22:06:48,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:48,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:48,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:48,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 355 proven. 239 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 22:06:50,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:50,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:06:50,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:50,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:06:50,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:50,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:06:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 756 proven. 2 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-07 22:06:54,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:54,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:06:54,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:06:54,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:06:54,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:06:54,987 INFO L87 Difference]: Start difference. First operand 405190 states and 469790 transitions. Second operand 9 states. [2019-09-07 22:07:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:07,157 INFO L93 Difference]: Finished difference Result 875821 states and 1023019 transitions. [2019-09-07 22:07:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 22:07:07,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 666 [2019-09-07 22:07:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:08,382 INFO L225 Difference]: With dead ends: 875821 [2019-09-07 22:07:08,382 INFO L226 Difference]: Without dead ends: 471939 [2019-09-07 22:07:08,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 22:07:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471939 states. [2019-09-07 22:07:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471939 to 462994. [2019-09-07 22:07:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462994 states. [2019-09-07 22:07:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462994 states to 462994 states and 529809 transitions. [2019-09-07 22:07:23,304 INFO L78 Accepts]: Start accepts. Automaton has 462994 states and 529809 transitions. Word has length 666 [2019-09-07 22:07:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:23,305 INFO L475 AbstractCegarLoop]: Abstraction has 462994 states and 529809 transitions. [2019-09-07 22:07:23,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:07:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 462994 states and 529809 transitions. [2019-09-07 22:07:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2019-09-07 22:07:23,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:23,366 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:07:23,366 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:23,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1992919492, now seen corresponding path program 1 times [2019-09-07 22:07:23,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:23,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:23,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:23,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:23,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 619 proven. 2 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2019-09-07 22:07:29,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:07:29,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:07:29,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:29,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:07:29,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:07:29,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 619 proven. 2 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2019-09-07 22:07:29,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:07:29,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:07:29,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:07:29,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:07:29,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:07:29,712 INFO L87 Difference]: Start difference. First operand 462994 states and 529809 transitions. Second operand 9 states. [2019-09-07 22:07:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:46,615 INFO L93 Difference]: Finished difference Result 902129 states and 1033273 transitions. [2019-09-07 22:07:46,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 22:07:46,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 699 [2019-09-07 22:07:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:47,569 INFO L225 Difference]: With dead ends: 902129 [2019-09-07 22:07:47,570 INFO L226 Difference]: Without dead ends: 443086 [2019-09-07 22:07:48,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=509, Invalid=2683, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 22:07:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443086 states. [2019-09-07 22:08:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443086 to 420180. [2019-09-07 22:08:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420180 states. [2019-09-07 22:08:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420180 states to 420180 states and 467976 transitions. [2019-09-07 22:08:01,535 INFO L78 Accepts]: Start accepts. Automaton has 420180 states and 467976 transitions. Word has length 699 [2019-09-07 22:08:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:01,535 INFO L475 AbstractCegarLoop]: Abstraction has 420180 states and 467976 transitions. [2019-09-07 22:08:01,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:08:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 420180 states and 467976 transitions. [2019-09-07 22:08:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-09-07 22:08:01,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:01,568 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:08:01,568 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash 290535415, now seen corresponding path program 1 times [2019-09-07 22:08:01,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:01,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:01,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:01,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2019-09-07 22:08:07,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:08:07,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:08:07,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:08:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:08:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:08:07,325 INFO L87 Difference]: Start difference. First operand 420180 states and 467976 transitions. Second operand 3 states. [2019-09-07 22:08:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:12,771 INFO L93 Difference]: Finished difference Result 826901 states and 918862 transitions. [2019-09-07 22:08:12,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:08:12,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 722 [2019-09-07 22:08:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:13,753 INFO L225 Difference]: With dead ends: 826901 [2019-09-07 22:08:13,754 INFO L226 Difference]: Without dead ends: 426898 [2019-09-07 22:08:14,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:08:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426898 states. [2019-09-07 22:08:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426898 to 408048. [2019-09-07 22:08:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408048 states. [2019-09-07 22:08:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408048 states to 408048 states and 452395 transitions. [2019-09-07 22:08:26,388 INFO L78 Accepts]: Start accepts. Automaton has 408048 states and 452395 transitions. Word has length 722 [2019-09-07 22:08:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:26,388 INFO L475 AbstractCegarLoop]: Abstraction has 408048 states and 452395 transitions. [2019-09-07 22:08:26,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:08:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 408048 states and 452395 transitions. [2019-09-07 22:08:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2019-09-07 22:08:26,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:26,430 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:08:26,430 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:26,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:26,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1333220255, now seen corresponding path program 1 times [2019-09-07 22:08:26,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:26,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:26,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:26,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:26,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 497 proven. 69 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2019-09-07 22:08:28,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:08:28,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:08:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:08:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:28,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:08:28,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:08:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 990 proven. 2 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-07 22:08:29,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:08:29,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-07 22:08:29,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:08:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:08:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:08:29,236 INFO L87 Difference]: Start difference. First operand 408048 states and 452395 transitions. Second operand 7 states. [2019-09-07 22:08:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:41,090 INFO L93 Difference]: Finished difference Result 818783 states and 909007 transitions. [2019-09-07 22:08:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 22:08:41,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 793 [2019-09-07 22:08:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:42,886 INFO L225 Difference]: With dead ends: 818783 [2019-09-07 22:08:42,887 INFO L226 Difference]: Without dead ends: 412043 [2019-09-07 22:08:43,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 793 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:08:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412043 states. [2019-09-07 22:08:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412043 to 411082. [2019-09-07 22:08:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411082 states. [2019-09-07 22:08:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411082 states to 411082 states and 454532 transitions. [2019-09-07 22:08:55,693 INFO L78 Accepts]: Start accepts. Automaton has 411082 states and 454532 transitions. Word has length 793 [2019-09-07 22:08:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:55,694 INFO L475 AbstractCegarLoop]: Abstraction has 411082 states and 454532 transitions. [2019-09-07 22:08:55,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:08:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 411082 states and 454532 transitions. [2019-09-07 22:08:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2019-09-07 22:08:55,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:55,757 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:08:55,757 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1051794468, now seen corresponding path program 1 times [2019-09-07 22:08:55,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:55,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-09-07 22:08:57,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:08:57,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:08:57,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:08:57,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:08:57,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:08:57,403 INFO L87 Difference]: Start difference. First operand 411082 states and 454532 transitions. Second operand 3 states. [2019-09-07 22:09:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:09:03,802 INFO L93 Difference]: Finished difference Result 835009 states and 921474 transitions. [2019-09-07 22:09:03,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:09:03,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 838 [2019-09-07 22:09:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:09:04,697 INFO L225 Difference]: With dead ends: 835009 [2019-09-07 22:09:04,698 INFO L226 Difference]: Without dead ends: 424350 [2019-09-07 22:09:04,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:09:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424350 states. [2019-09-07 22:09:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424350 to 394342. [2019-09-07 22:09:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394342 states. [2019-09-07 22:09:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394342 states to 394342 states and 432208 transitions. [2019-09-07 22:09:19,364 INFO L78 Accepts]: Start accepts. Automaton has 394342 states and 432208 transitions. Word has length 838 [2019-09-07 22:09:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:09:19,364 INFO L475 AbstractCegarLoop]: Abstraction has 394342 states and 432208 transitions. [2019-09-07 22:09:19,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:09:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 394342 states and 432208 transitions. [2019-09-07 22:09:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2019-09-07 22:09:19,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:09:19,420 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:09:19,421 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:09:19,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:09:19,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1691998048, now seen corresponding path program 1 times [2019-09-07 22:09:19,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:09:19,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:09:19,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:19,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:19,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 562 proven. 147 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2019-09-07 22:09:20,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:09:20,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:09:20,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:21,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:09:21,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:09:21,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:21,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 1074 proven. 2 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-09-07 22:09:21,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:09:21,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-07 22:09:21,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:09:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:09:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:09:21,781 INFO L87 Difference]: Start difference. First operand 394342 states and 432208 transitions. Second operand 9 states. [2019-09-07 22:09:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:09:35,938 INFO L93 Difference]: Finished difference Result 840187 states and 927150 transitions. [2019-09-07 22:09:35,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 22:09:35,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 845 [2019-09-07 22:09:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:09:37,663 INFO L225 Difference]: With dead ends: 840187 [2019-09-07 22:09:37,663 INFO L226 Difference]: Without dead ends: 452034 [2019-09-07 22:09:37,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 22:09:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452034 states. [2019-09-07 22:09:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452034 to 426663. [2019-09-07 22:09:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426663 states. [2019-09-07 22:09:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426663 states to 426663 states and 466972 transitions. [2019-09-07 22:09:55,001 INFO L78 Accepts]: Start accepts. Automaton has 426663 states and 466972 transitions. Word has length 845 [2019-09-07 22:09:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:09:55,002 INFO L475 AbstractCegarLoop]: Abstraction has 426663 states and 466972 transitions. [2019-09-07 22:09:55,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:09:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 426663 states and 466972 transitions. [2019-09-07 22:09:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2019-09-07 22:09:55,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:09:55,075 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:09:55,076 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:09:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:09:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304862, now seen corresponding path program 1 times [2019-09-07 22:09:55,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:09:55,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:09:55,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:55,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:55,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 877 proven. 112 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2019-09-07 22:09:57,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:09:57,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:09:57,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:57,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:09:57,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:09:57,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:57,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 737 proven. 32 refuted. 0 times theorem prover too weak. 803 trivial. 0 not checked. [2019-09-07 22:09:58,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:09:58,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2019-09-07 22:09:58,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:09:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:09:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:09:58,239 INFO L87 Difference]: Start difference. First operand 426663 states and 466972 transitions. Second operand 14 states.