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/Problem18_label57.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:48:49,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:48:49,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:48:49,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:48:49,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:48:49,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:48:49,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:48:49,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:48:49,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:48:49,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:48:49,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:48:49,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:48:49,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:48:49,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:48:49,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:48:49,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:48:49,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:48:49,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:48:49,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:48:49,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:48:49,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:48:49,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:48:49,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:48:49,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:48:49,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:48:49,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:48:49,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:48:49,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:48:49,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:48:49,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:48:49,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:48:49,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:48:49,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:48:49,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:48:49,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:48:49,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:48:49,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:48:49,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:48:49,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:48:49,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:48:49,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:48:49,919 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 22:48:49,936 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:48:49,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:48:49,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:48:49,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:48:49,939 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:48:49,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:48:49,939 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:48:49,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:48:49,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:48:49,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:48:49,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:48:49,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:48:49,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:48:49,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:48:49,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:48:49,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:48:49,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:48:49,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:48:49,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:48:49,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:48:49,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:48:49,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:48:49,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:48:49,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:48:49,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:48:49,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:48:49,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:48:49,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:48:49,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:48:49,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:48:49,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:48:49,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:48:49,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:48:49,995 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:48:49,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label57.c [2019-09-07 22:48:50,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f93a21f/aa14b9d1ae8f4067a37d526dc5a6b67f/FLAGb595511b3 [2019-09-07 22:48:50,813 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:48:50,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label57.c [2019-09-07 22:48:50,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f93a21f/aa14b9d1ae8f4067a37d526dc5a6b67f/FLAGb595511b3 [2019-09-07 22:48:50,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f93a21f/aa14b9d1ae8f4067a37d526dc5a6b67f [2019-09-07 22:48:50,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:48:50,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:48:50,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:48:50,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:48:50,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:48:50,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:48:50" (1/1) ... [2019-09-07 22:48:50,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad31ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:50, skipping insertion in model container [2019-09-07 22:48:50,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:48:50" (1/1) ... [2019-09-07 22:48:50,896 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:48:51,033 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:48:52,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:48:52,255 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:48:52,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:48:52,729 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:48:52,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52 WrapperNode [2019-09-07 22:48:52,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:48:52,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:48:52,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:48:52,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:48:52,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (1/1) ... [2019-09-07 22:48:52,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (1/1) ... [2019-09-07 22:48:52,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (1/1) ... [2019-09-07 22:48:52,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (1/1) ... [2019-09-07 22:48:52,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (1/1) ... [2019-09-07 22:48:52,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (1/1) ... [2019-09-07 22:48:52,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (1/1) ... [2019-09-07 22:48:53,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:48:53,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:48:53,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:48:53,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:48:53,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (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 22:48:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:48:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:48:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:48:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:48:53,161 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:48:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:48:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:48:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:48:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:48:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:48:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:48:53,163 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:48:53,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:48:53,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:48:53,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:48:56,784 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:48:56,784 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:48:56,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:48:56 BoogieIcfgContainer [2019-09-07 22:48:56,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:48:56,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:48:56,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:48:56,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:48:56,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:48:50" (1/3) ... [2019-09-07 22:48:56,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ceb37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:48:56, skipping insertion in model container [2019-09-07 22:48:56,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:48:52" (2/3) ... [2019-09-07 22:48:56,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ceb37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:48:56, skipping insertion in model container [2019-09-07 22:48:56,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:48:56" (3/3) ... [2019-09-07 22:48:56,794 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label57.c [2019-09-07 22:48:56,804 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:48:56,815 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:48:56,833 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:48:56,887 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:48:56,888 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:48:56,888 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:48:56,889 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:48:56,889 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:48:56,889 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:48:56,889 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:48:56,889 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:48:56,889 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:48:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-07 22:48:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 22:48:56,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:48:56,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:48:56,937 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:48:56,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:48:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 12338169, now seen corresponding path program 1 times [2019-09-07 22:48:56,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:48:56,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:48:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:48:56,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:48:56,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:48:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:48:57,157 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 22:48:57,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:48:57,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:48:57,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:48:57,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:48:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:48:57,185 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 3 states. [2019-09-07 22:49:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:49:01,902 INFO L93 Difference]: Finished difference Result 2248 states and 4319 transitions. [2019-09-07 22:49:01,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:49:01,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-07 22:49:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:49:01,938 INFO L225 Difference]: With dead ends: 2248 [2019-09-07 22:49:01,938 INFO L226 Difference]: Without dead ends: 1412 [2019-09-07 22:49:01,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:49:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-09-07 22:49:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-09-07 22:49:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-09-07 22:49:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2630 transitions. [2019-09-07 22:49:02,123 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2630 transitions. Word has length 14 [2019-09-07 22:49:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:49:02,124 INFO L475 AbstractCegarLoop]: Abstraction has 1412 states and 2630 transitions. [2019-09-07 22:49:02,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:49:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2630 transitions. [2019-09-07 22:49:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 22:49:02,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:49:02,130 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:49:02,131 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:49:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:49:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1162140268, now seen corresponding path program 1 times [2019-09-07 22:49:02,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:49:02,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:49:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:02,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:02,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:49:02,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:49:02,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:49:02,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:49:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:49:02,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:49:02,414 INFO L87 Difference]: Start difference. First operand 1412 states and 2630 transitions. Second operand 6 states. [2019-09-07 22:49:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:49:07,739 INFO L93 Difference]: Finished difference Result 4294 states and 8031 transitions. [2019-09-07 22:49:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:49:07,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-09-07 22:49:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:49:07,763 INFO L225 Difference]: With dead ends: 4294 [2019-09-07 22:49:07,763 INFO L226 Difference]: Without dead ends: 2888 [2019-09-07 22:49:07,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 22:49:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-09-07 22:49:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2864. [2019-09-07 22:49:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2864 states. [2019-09-07 22:49:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4761 transitions. [2019-09-07 22:49:07,852 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 4761 transitions. Word has length 88 [2019-09-07 22:49:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:49:07,853 INFO L475 AbstractCegarLoop]: Abstraction has 2864 states and 4761 transitions. [2019-09-07 22:49:07,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:49:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 4761 transitions. [2019-09-07 22:49:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 22:49:07,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:49:07,857 INFO L399 BasicCegarLoop]: trace histogram [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:49:07,858 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:49:07,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:49:07,858 INFO L82 PathProgramCache]: Analyzing trace with hash 776806676, now seen corresponding path program 1 times [2019-09-07 22:49:07,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:49:07,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:49:07,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:07,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:49:08,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:49:08,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:49:08,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:49:08,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:49:08,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:49:08,047 INFO L87 Difference]: Start difference. First operand 2864 states and 4761 transitions. Second operand 6 states. [2019-09-07 22:49:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:49:12,901 INFO L93 Difference]: Finished difference Result 7205 states and 11771 transitions. [2019-09-07 22:49:12,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:49:12,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-07 22:49:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:49:12,934 INFO L225 Difference]: With dead ends: 7205 [2019-09-07 22:49:12,934 INFO L226 Difference]: Without dead ends: 4347 [2019-09-07 22:49:12,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 22:49:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4347 states. [2019-09-07 22:49:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4347 to 4331. [2019-09-07 22:49:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2019-09-07 22:49:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 6101 transitions. [2019-09-07 22:49:13,092 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 6101 transitions. Word has length 100 [2019-09-07 22:49:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:49:13,093 INFO L475 AbstractCegarLoop]: Abstraction has 4331 states and 6101 transitions. [2019-09-07 22:49:13,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:49:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 6101 transitions. [2019-09-07 22:49:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 22:49:13,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:49:13,099 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:49:13,103 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:49:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:49:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash 510205601, now seen corresponding path program 1 times [2019-09-07 22:49:13,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:49:13,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:49:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:13,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:49:13,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:49:13,387 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:49:13,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:13,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:49:13,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:49:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:49:13,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:49:13,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 22:49:13,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:49:13,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:49:13,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:49:13,595 INFO L87 Difference]: Start difference. First operand 4331 states and 6101 transitions. Second operand 8 states. [2019-09-07 22:49:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:49:23,695 INFO L93 Difference]: Finished difference Result 17254 states and 24651 transitions. [2019-09-07 22:49:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 22:49:23,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2019-09-07 22:49:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:49:23,759 INFO L225 Difference]: With dead ends: 17254 [2019-09-07 22:49:23,759 INFO L226 Difference]: Without dead ends: 12929 [2019-09-07 22:49:23,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:49:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12929 states. [2019-09-07 22:49:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12929 to 11462. [2019-09-07 22:49:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11462 states. [2019-09-07 22:49:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11462 states to 11462 states and 15406 transitions. [2019-09-07 22:49:24,085 INFO L78 Accepts]: Start accepts. Automaton has 11462 states and 15406 transitions. Word has length 125 [2019-09-07 22:49:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:49:24,087 INFO L475 AbstractCegarLoop]: Abstraction has 11462 states and 15406 transitions. [2019-09-07 22:49:24,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:49:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 11462 states and 15406 transitions. [2019-09-07 22:49:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-07 22:49:24,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:49:24,097 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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:49:24,097 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:49:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:49:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash -373766813, now seen corresponding path program 1 times [2019-09-07 22:49:24,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:49:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:49:24,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:24,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:24,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:49:24,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:49:24,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:49:24,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:49:24,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:49:24,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:49:24,281 INFO L87 Difference]: Start difference. First operand 11462 states and 15406 transitions. Second operand 4 states. [2019-09-07 22:49:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:49:30,732 INFO L93 Difference]: Finished difference Result 41388 states and 57301 transitions. [2019-09-07 22:49:30,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:49:30,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-09-07 22:49:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:49:30,870 INFO L225 Difference]: With dead ends: 41388 [2019-09-07 22:49:30,870 INFO L226 Difference]: Without dead ends: 29932 [2019-09-07 22:49:30,905 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 22:49:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29932 states. [2019-09-07 22:49:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29932 to 27116. [2019-09-07 22:49:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27116 states. [2019-09-07 22:49:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27116 states to 27116 states and 37011 transitions. [2019-09-07 22:49:31,584 INFO L78 Accepts]: Start accepts. Automaton has 27116 states and 37011 transitions. Word has length 208 [2019-09-07 22:49:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:49:31,585 INFO L475 AbstractCegarLoop]: Abstraction has 27116 states and 37011 transitions. [2019-09-07 22:49:31,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:49:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27116 states and 37011 transitions. [2019-09-07 22:49:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-09-07 22:49:31,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:49:31,668 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:49:31,668 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:49:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:49:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1841222801, now seen corresponding path program 1 times [2019-09-07 22:49:31,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:49:31,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:49:31,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:31,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:31,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-07 22:49:32,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:49:32,885 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:49:32,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:33,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:49:33,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:49:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:49:33,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:49:33,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-07 22:49:33,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:49:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:49:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:49:33,473 INFO L87 Difference]: Start difference. First operand 27116 states and 37011 transitions. Second operand 6 states. [2019-09-07 22:49:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:49:39,835 INFO L93 Difference]: Finished difference Result 63991 states and 89309 transitions. [2019-09-07 22:49:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 22:49:39,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 653 [2019-09-07 22:49:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:49:39,965 INFO L225 Difference]: With dead ends: 63991 [2019-09-07 22:49:39,966 INFO L226 Difference]: Without dead ends: 36881 [2019-09-07 22:49:40,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:49:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36881 states. [2019-09-07 22:49:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36881 to 33278. [2019-09-07 22:49:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33278 states. [2019-09-07 22:49:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33278 states to 33278 states and 45729 transitions. [2019-09-07 22:49:40,973 INFO L78 Accepts]: Start accepts. Automaton has 33278 states and 45729 transitions. Word has length 653 [2019-09-07 22:49:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:49:40,974 INFO L475 AbstractCegarLoop]: Abstraction has 33278 states and 45729 transitions. [2019-09-07 22:49:40,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:49:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33278 states and 45729 transitions. [2019-09-07 22:49:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-09-07 22:49:41,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:49:41,057 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:49:41,057 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:49:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:49:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash -792624105, now seen corresponding path program 1 times [2019-09-07 22:49:41,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:49:41,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:49:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:41,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 212 proven. 252 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-07 22:49:41,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:49:41,928 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 22:49:41,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:42,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:49:42,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:49:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 623 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 22:49:42,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:49:42,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:49:42,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:49:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:49:42,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:49:42,381 INFO L87 Difference]: Start difference. First operand 33278 states and 45729 transitions. Second operand 9 states. [2019-09-07 22:49:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:49:51,059 INFO L93 Difference]: Finished difference Result 79828 states and 114840 transitions. [2019-09-07 22:49:51,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:49:51,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 752 [2019-09-07 22:49:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:49:51,245 INFO L225 Difference]: With dead ends: 79828 [2019-09-07 22:49:51,246 INFO L226 Difference]: Without dead ends: 46556 [2019-09-07 22:49:51,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:49:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46556 states. [2019-09-07 22:49:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46556 to 43480. [2019-09-07 22:49:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43480 states. [2019-09-07 22:49:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43480 states to 43480 states and 55671 transitions. [2019-09-07 22:49:52,255 INFO L78 Accepts]: Start accepts. Automaton has 43480 states and 55671 transitions. Word has length 752 [2019-09-07 22:49:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:49:52,256 INFO L475 AbstractCegarLoop]: Abstraction has 43480 states and 55671 transitions. [2019-09-07 22:49:52,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:49:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 43480 states and 55671 transitions. [2019-09-07 22:49:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2019-09-07 22:49:52,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:49:52,383 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:49:52,383 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:49:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:49:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash -587629946, now seen corresponding path program 1 times [2019-09-07 22:49:52,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:49:52,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:49:52,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:52,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:49:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 130 proven. 190 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2019-09-07 22:49:54,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:49:54,009 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:49:54,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:49:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:49:54,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:49:54,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:49:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 542 proven. 2 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-07 22:49:54,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:49:54,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:49:54,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:49:54,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:49:54,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:49:54,752 INFO L87 Difference]: Start difference. First operand 43480 states and 55671 transitions. Second operand 9 states. [2019-09-07 22:50:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:50:09,150 INFO L93 Difference]: Finished difference Result 146311 states and 201092 transitions. [2019-09-07 22:50:09,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 22:50:09,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 795 [2019-09-07 22:50:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:50:09,502 INFO L225 Difference]: With dead ends: 146311 [2019-09-07 22:50:09,502 INFO L226 Difference]: Without dead ends: 102841 [2019-09-07 22:50:09,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:50:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102841 states. [2019-09-07 22:50:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102841 to 97111. [2019-09-07 22:50:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97111 states. [2019-09-07 22:50:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97111 states to 97111 states and 127778 transitions. [2019-09-07 22:50:11,776 INFO L78 Accepts]: Start accepts. Automaton has 97111 states and 127778 transitions. Word has length 795 [2019-09-07 22:50:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:50:11,777 INFO L475 AbstractCegarLoop]: Abstraction has 97111 states and 127778 transitions. [2019-09-07 22:50:11,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:50:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 97111 states and 127778 transitions. [2019-09-07 22:50:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2019-09-07 22:50:11,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:50:11,990 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:50:11,990 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:50:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:50:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -506913420, now seen corresponding path program 1 times [2019-09-07 22:50:11,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:50:11,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:50:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:50:11,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:50:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:50:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:50:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 21 proven. 236 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-07 22:50:13,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:50:13,766 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:50:15,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:50:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:50:15,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 22:50:15,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:50:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:50:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2019-09-07 22:50:15,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:50:15,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 22:50:15,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:50:15,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:50:15,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:50:15,958 INFO L87 Difference]: Start difference. First operand 97111 states and 127778 transitions. Second operand 11 states. [2019-09-07 22:50:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:50:33,768 INFO L93 Difference]: Finished difference Result 202580 states and 279717 transitions. [2019-09-07 22:50:33,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 22:50:33,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 834 [2019-09-07 22:50:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:50:34,318 INFO L225 Difference]: With dead ends: 202580 [2019-09-07 22:50:34,318 INFO L226 Difference]: Without dead ends: 106177 [2019-09-07 22:50:34,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=522, Invalid=2234, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 22:50:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106177 states. [2019-09-07 22:50:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106177 to 105148. [2019-09-07 22:50:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105148 states. [2019-09-07 22:50:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105148 states to 105148 states and 136997 transitions. [2019-09-07 22:50:37,259 INFO L78 Accepts]: Start accepts. Automaton has 105148 states and 136997 transitions. Word has length 834 [2019-09-07 22:50:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:50:37,260 INFO L475 AbstractCegarLoop]: Abstraction has 105148 states and 136997 transitions. [2019-09-07 22:50:37,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:50:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 105148 states and 136997 transitions. [2019-09-07 22:50:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1003 [2019-09-07 22:50:37,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:50:37,379 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:50:37,379 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:50:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:50:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2101859740, now seen corresponding path program 1 times [2019-09-07 22:50:37,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:50:37,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:50:37,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:50:37,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:50:37,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:50:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:50:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 701 proven. 19 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-09-07 22:50:40,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:50:40,320 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:50:40,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:50:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:50:40,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:50:40,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:50:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:50:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-09-07 22:50:40,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:50:40,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-07 22:50:40,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:50:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:50:40,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:50:40,999 INFO L87 Difference]: Start difference. First operand 105148 states and 136997 transitions. Second operand 14 states. [2019-09-07 22:51:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:51:18,104 INFO L93 Difference]: Finished difference Result 264791 states and 400665 transitions. [2019-09-07 22:51:18,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-07 22:51:18,105 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1002 [2019-09-07 22:51:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:51:18,832 INFO L225 Difference]: With dead ends: 264791 [2019-09-07 22:51:18,832 INFO L226 Difference]: Without dead ends: 160351 [2019-09-07 22:51:19,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1042 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5772 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2272, Invalid=12490, Unknown=0, NotChecked=0, Total=14762 [2019-09-07 22:51:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160351 states. [2019-09-07 22:51:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160351 to 153652. [2019-09-07 22:51:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153652 states. [2019-09-07 22:51:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153652 states to 153652 states and 193575 transitions. [2019-09-07 22:51:25,690 INFO L78 Accepts]: Start accepts. Automaton has 153652 states and 193575 transitions. Word has length 1002 [2019-09-07 22:51:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:51:25,691 INFO L475 AbstractCegarLoop]: Abstraction has 153652 states and 193575 transitions. [2019-09-07 22:51:25,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 22:51:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 153652 states and 193575 transitions. [2019-09-07 22:51:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1098 [2019-09-07 22:51:25,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:51:25,819 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 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] [2019-09-07 22:51:25,819 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:51:25,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:51:25,820 INFO L82 PathProgramCache]: Analyzing trace with hash -384617619, now seen corresponding path program 1 times [2019-09-07 22:51:25,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:51:25,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:51:25,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:51:25,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:51:25,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:51:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:51:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 102 proven. 1147 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-09-07 22:51:28,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:51:28,007 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:51:28,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:51:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:51:28,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:51:28,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:51:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1735 backedges. 1282 proven. 2 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 22:51:30,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:51:30,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 22:51:30,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:51:30,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:51:30,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:51:30,575 INFO L87 Difference]: Start difference. First operand 153652 states and 193575 transitions. Second operand 15 states. [2019-09-07 22:51:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:51:49,180 INFO L93 Difference]: Finished difference Result 300837 states and 381243 transitions. [2019-09-07 22:51:49,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 22:51:49,182 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1097 [2019-09-07 22:51:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:51:49,488 INFO L225 Difference]: With dead ends: 300837 [2019-09-07 22:51:49,488 INFO L226 Difference]: Without dead ends: 141602 [2019-09-07 22:51:49,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1193 GetRequests, 1136 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=671, Invalid=2751, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 22:51:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141602 states. [2019-09-07 22:51:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141602 to 132266. [2019-09-07 22:51:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132266 states. [2019-09-07 22:51:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132266 states to 132266 states and 155370 transitions. [2019-09-07 22:51:51,925 INFO L78 Accepts]: Start accepts. Automaton has 132266 states and 155370 transitions. Word has length 1097 [2019-09-07 22:51:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:51:51,925 INFO L475 AbstractCegarLoop]: Abstraction has 132266 states and 155370 transitions. [2019-09-07 22:51:51,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:51:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 132266 states and 155370 transitions. [2019-09-07 22:51:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1666 [2019-09-07 22:51:51,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:51:51,999 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 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:51:51,999 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:51:51,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:51:52,000 INFO L82 PathProgramCache]: Analyzing trace with hash 652818794, now seen corresponding path program 1 times [2019-09-07 22:51:52,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:51:52,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:51:52,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:51:52,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:51:52,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:51:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:51:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 186 proven. 2544 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 22:51:59,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:51:59,385 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:51:59,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:51:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:51:59,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 2093 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:51:59,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:51:59,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:52:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 1923 proven. 2 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-09-07 22:52:00,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:52:00,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 25 [2019-09-07 22:52:00,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 22:52:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 22:52:00,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-09-07 22:52:00,786 INFO L87 Difference]: Start difference. First operand 132266 states and 155370 transitions. Second operand 25 states. [2019-09-07 22:52:07,930 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-07 22:52:13,139 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-07 22:52:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:52:39,110 INFO L93 Difference]: Finished difference Result 278959 states and 328062 transitions. [2019-09-07 22:52:39,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-07 22:52:39,111 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1665 [2019-09-07 22:52:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:52:39,478 INFO L225 Difference]: With dead ends: 278959 [2019-09-07 22:52:39,478 INFO L226 Difference]: Without dead ends: 147405 [2019-09-07 22:52:39,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1898 GetRequests, 1760 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7113 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2760, Invalid=16146, Unknown=0, NotChecked=0, Total=18906 [2019-09-07 22:52:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147405 states. [2019-09-07 22:52:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147405 to 142768. [2019-09-07 22:52:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142768 states. [2019-09-07 22:52:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142768 states to 142768 states and 161185 transitions. [2019-09-07 22:52:41,542 INFO L78 Accepts]: Start accepts. Automaton has 142768 states and 161185 transitions. Word has length 1665 [2019-09-07 22:52:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:52:41,543 INFO L475 AbstractCegarLoop]: Abstraction has 142768 states and 161185 transitions. [2019-09-07 22:52:41,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 22:52:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 142768 states and 161185 transitions. [2019-09-07 22:52:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1676 [2019-09-07 22:52:41,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:52:41,609 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:41,609 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:52:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:52:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash 623450544, now seen corresponding path program 1 times [2019-09-07 22:52:41,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:52:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:52:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:52:41,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:52:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:52:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:52:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2471 backedges. 299 proven. 248 refuted. 0 times theorem prover too weak. 1924 trivial. 0 not checked. [2019-09-07 22:52:43,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:52:43,845 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:52:43,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:52:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:52:44,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 2083 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:52:44,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:52:44,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:52:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2471 backedges. 1834 proven. 2 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2019-09-07 22:52:45,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:52:45,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:52:45,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:52:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:52:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:52:45,844 INFO L87 Difference]: Start difference. First operand 142768 states and 161185 transitions. Second operand 8 states. [2019-09-07 22:53:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:53:00,452 INFO L93 Difference]: Finished difference Result 298294 states and 336045 transitions. [2019-09-07 22:53:00,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 22:53:00,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1675 [2019-09-07 22:53:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:53:00,762 INFO L225 Difference]: With dead ends: 298294 [2019-09-07 22:53:00,763 INFO L226 Difference]: Without dead ends: 152594 [2019-09-07 22:53:00,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1736 GetRequests, 1701 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 22:53:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152594 states. [2019-09-07 22:53:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152594 to 151014. [2019-09-07 22:53:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151014 states. [2019-09-07 22:53:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151014 states to 151014 states and 165554 transitions. [2019-09-07 22:53:05,974 INFO L78 Accepts]: Start accepts. Automaton has 151014 states and 165554 transitions. Word has length 1675 [2019-09-07 22:53:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:53:05,975 INFO L475 AbstractCegarLoop]: Abstraction has 151014 states and 165554 transitions. [2019-09-07 22:53:05,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:53:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 151014 states and 165554 transitions. [2019-09-07 22:53:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1812 [2019-09-07 22:53:06,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:53:06,054 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:53:06,055 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:53:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:53:06,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1775409786, now seen corresponding path program 1 times [2019-09-07 22:53:06,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:53:06,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:53:06,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:06,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:53:06,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:53:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3154 backedges. 436 proven. 242 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2019-09-07 22:53:08,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:53:08,908 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:53:08,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:53:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:53:09,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 2259 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:53:09,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:53:09,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:53:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:53:09,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:53:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3154 backedges. 2238 proven. 2 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2019-09-07 22:53:12,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:53:12,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:53:12,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:53:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:53:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:53:12,800 INFO L87 Difference]: Start difference. First operand 151014 states and 165554 transitions. Second operand 8 states. [2019-09-07 22:53:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:53:31,058 INFO L93 Difference]: Finished difference Result 317169 states and 348343 transitions. [2019-09-07 22:53:31,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 22:53:31,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1811 [2019-09-07 22:53:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:53:31,398 INFO L225 Difference]: With dead ends: 317169 [2019-09-07 22:53:31,399 INFO L226 Difference]: Without dead ends: 166116 [2019-09-07 22:53:31,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1870 GetRequests, 1836 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 22:53:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166116 states. [2019-09-07 22:53:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166116 to 165312. [2019-09-07 22:53:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165312 states. [2019-09-07 22:53:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165312 states to 165312 states and 179475 transitions. [2019-09-07 22:53:33,798 INFO L78 Accepts]: Start accepts. Automaton has 165312 states and 179475 transitions. Word has length 1811 [2019-09-07 22:53:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:53:33,800 INFO L475 AbstractCegarLoop]: Abstraction has 165312 states and 179475 transitions. [2019-09-07 22:53:33,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:53:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 165312 states and 179475 transitions. [2019-09-07 22:53:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1894 [2019-09-07 22:53:33,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:53:33,891 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 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:53:33,891 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:53:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:53:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1816589750, now seen corresponding path program 1 times [2019-09-07 22:53:33,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:53:33,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:53:33,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:33,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:53:33,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:53:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:53:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4791 backedges. 544 proven. 306 refuted. 0 times theorem prover too weak. 3941 trivial. 0 not checked. [2019-09-07 22:53:36,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:53:36,521 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:53:36,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:53:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:53:37,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:53:37,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:53:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4791 backedges. 3119 proven. 2 refuted. 0 times theorem prover too weak. 1670 trivial. 0 not checked. [2019-09-07 22:53:40,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:53:40,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:53:40,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:53:40,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:53:40,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:53:40,824 INFO L87 Difference]: Start difference. First operand 165312 states and 179475 transitions. Second operand 9 states. [2019-09-07 22:53:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:53:53,515 INFO L93 Difference]: Finished difference Result 353847 states and 398105 transitions. [2019-09-07 22:53:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:53:53,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1893 [2019-09-07 22:53:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:53:54,433 INFO L225 Difference]: With dead ends: 353847 [2019-09-07 22:53:54,433 INFO L226 Difference]: Without dead ends: 196985 [2019-09-07 22:53:54,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1916 GetRequests, 1900 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:53:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196985 states. [2019-09-07 22:54:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196985 to 191721. [2019-09-07 22:54:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191721 states. [2019-09-07 22:54:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191721 states to 191721 states and 217824 transitions. [2019-09-07 22:54:01,085 INFO L78 Accepts]: Start accepts. Automaton has 191721 states and 217824 transitions. Word has length 1893 [2019-09-07 22:54:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:54:01,086 INFO L475 AbstractCegarLoop]: Abstraction has 191721 states and 217824 transitions. [2019-09-07 22:54:01,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:54:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 191721 states and 217824 transitions. [2019-09-07 22:54:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1915 [2019-09-07 22:54:01,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:54:01,209 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:01,210 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:54:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:54:01,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1975746482, now seen corresponding path program 1 times [2019-09-07 22:54:01,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:54:01,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:54:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:54:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:54:01,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:54:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:54:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3668 backedges. 1834 proven. 1447 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-07 22:54:06,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:54:06,974 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:54:06,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:54:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:54:07,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 2364 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 22:54:07,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:54:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:54:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:54:07,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:54:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:54:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:54:07,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:54:07,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:54:20,773 WARN L188 SmtUtils]: Spent 13.09 s on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-07 22:54:20,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:54:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3668 backedges. 2264 proven. 571 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2019-09-07 22:54:24,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:54:24,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 26 [2019-09-07 22:54:24,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 22:54:24,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 22:54:24,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-09-07 22:54:24,022 INFO L87 Difference]: Start difference. First operand 191721 states and 217824 transitions. Second operand 26 states. [2019-09-07 22:54:35,793 WARN L188 SmtUtils]: Spent 7.49 s on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-07 22:54:45,079 WARN L188 SmtUtils]: Spent 7.51 s on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-07 22:54:55,634 WARN L188 SmtUtils]: Spent 10.07 s on a formula simplification that was a NOOP. DAG size: 56 [2019-09-07 22:55:01,573 WARN L188 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-07 22:55:05,622 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-07 22:55:15,396 WARN L188 SmtUtils]: Spent 7.80 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-07 22:55:23,213 WARN L188 SmtUtils]: Spent 7.72 s on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-07 22:55:32,612 WARN L188 SmtUtils]: Spent 9.25 s on a formula simplification that was a NOOP. DAG size: 58 [2019-09-07 22:55:39,961 WARN L188 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-09-07 22:55:52,471 WARN L188 SmtUtils]: Spent 10.09 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 22:55:58,658 WARN L188 SmtUtils]: Spent 5.64 s on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-07 22:56:04,378 WARN L188 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-09-07 22:56:15,101 WARN L188 SmtUtils]: Spent 10.21 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-07 22:56:23,927 WARN L188 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-07 22:56:31,918 WARN L188 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-07 22:56:41,762 WARN L188 SmtUtils]: Spent 6.37 s on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-07 22:56:47,535 WARN L188 SmtUtils]: Spent 5.64 s on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-09-07 22:56:55,266 WARN L188 SmtUtils]: Spent 7.48 s on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-09-07 22:57:01,825 WARN L188 SmtUtils]: Spent 5.91 s on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-07 22:57:08,127 WARN L188 SmtUtils]: Spent 5.77 s on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-07 22:57:13,764 WARN L188 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-07 22:57:21,341 WARN L188 SmtUtils]: Spent 7.45 s on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-07 22:57:22,545 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-07 22:57:22,843 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-07 22:57:30,333 WARN L188 SmtUtils]: Spent 7.43 s on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-07 22:57:31,869 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-09-07 22:57:32,816 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-07 22:57:39,899 WARN L188 SmtUtils]: Spent 7.00 s on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-07 22:57:50,188 WARN L188 SmtUtils]: Spent 10.08 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 22:58:00,442 WARN L188 SmtUtils]: Spent 10.05 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 22:58:11,167 WARN L188 SmtUtils]: Spent 8.02 s on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-07 22:58:17,254 WARN L188 SmtUtils]: Spent 5.84 s on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-09-07 22:58:22,936 WARN L188 SmtUtils]: Spent 5.62 s on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-09-07 22:58:31,055 WARN L188 SmtUtils]: Spent 7.94 s on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-09-07 22:58:31,255 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-07 22:58:41,463 WARN L188 SmtUtils]: Spent 7.02 s on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-07 22:58:48,612 WARN L188 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-07 22:58:58,331 WARN L188 SmtUtils]: Spent 7.06 s on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-07 22:59:04,424 WARN L188 SmtUtils]: Spent 5.89 s on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-07 22:59:10,718 WARN L188 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2019-09-07 22:59:21,389 WARN L188 SmtUtils]: Spent 7.75 s on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-07 22:59:28,260 WARN L188 SmtUtils]: Spent 5.88 s on a formula simplification. DAG size of input: 61 DAG size of output: 19 [2019-09-07 22:59:36,576 WARN L188 SmtUtils]: Spent 8.13 s on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-07 22:59:43,448 WARN L188 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-07 22:59:49,570 WARN L188 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-07 22:59:59,874 WARN L188 SmtUtils]: Spent 7.61 s on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-07 23:00:08,114 WARN L188 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-07 23:00:29,359 WARN L188 SmtUtils]: Spent 16.25 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-07 23:00:36,060 WARN L188 SmtUtils]: Spent 5.98 s on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-07 23:00:58,729 WARN L188 SmtUtils]: Spent 18.74 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 23:01:05,755 WARN L188 SmtUtils]: Spent 5.69 s on a formula simplification. DAG size of input: 80 DAG size of output: 38 [2019-09-07 23:01:15,708 WARN L188 SmtUtils]: Spent 6.91 s on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-07 23:01:23,141 WARN L188 SmtUtils]: Spent 7.23 s on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-07 23:01:30,105 WARN L188 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-07 23:01:37,426 WARN L188 SmtUtils]: Spent 6.95 s on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-07 23:01:44,768 WARN L188 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-09-07 23:01:50,732 WARN L188 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 65 DAG size of output: 29