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_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:23:58,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:23:58,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:23:58,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:23:58,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:23:58,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:23:58,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:23:58,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:23:58,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:23:58,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:23:58,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:23:58,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:23:58,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:23:58,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:23:58,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:23:58,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:23:58,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:23:58,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:23:58,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:23:58,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:23:58,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:23:58,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:23:58,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:23:58,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:23:58,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:23:58,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:23:58,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:23:58,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:23:58,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:23:58,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:23:58,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:23:58,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:23:58,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:23:58,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:23:58,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:23:58,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:23:58,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:23:58,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:23:58,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:23:58,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:23:58,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:23:58,798 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:23:58,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:23:58,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:23:58,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:23:58,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:23:58,838 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:23:58,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:23:58,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:23:58,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:23:58,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:23:58,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:23:58,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:23:58,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:23:58,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:23:58,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:23:58,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:23:58,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:23:58,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:23:58,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:23:58,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:23:58,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:23:58,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:23:58,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:23:58,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:23:58,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:23:58,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:23:58,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:23:58,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:23:58,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:23:58,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:23:58,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:23:58,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:23:58,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:23:58,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:23:58,914 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:23:58,915 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label08.c [2019-09-07 22:23:58,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1b043f7/0f90046a6cd8463cbd2ce15caece24f3/FLAG93ceeee58 [2019-09-07 22:23:59,730 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:23:59,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label08.c [2019-09-07 22:23:59,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1b043f7/0f90046a6cd8463cbd2ce15caece24f3/FLAG93ceeee58 [2019-09-07 22:23:59,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1b043f7/0f90046a6cd8463cbd2ce15caece24f3 [2019-09-07 22:23:59,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:23:59,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:23:59,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:23:59,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:23:59,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:23:59,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:23:59" (1/1) ... [2019-09-07 22:23:59,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:23:59, skipping insertion in model container [2019-09-07 22:23:59,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:23:59" (1/1) ... [2019-09-07 22:23:59,878 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:24:00,013 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:24:01,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:24:01,157 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:24:01,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:24:01,760 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:24:01,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01 WrapperNode [2019-09-07 22:24:01,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:24:01,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:24:01,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:24:01,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:24:01,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (1/1) ... [2019-09-07 22:24:01,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (1/1) ... [2019-09-07 22:24:01,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (1/1) ... [2019-09-07 22:24:01,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (1/1) ... [2019-09-07 22:24:01,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (1/1) ... [2019-09-07 22:24:01,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (1/1) ... [2019-09-07 22:24:02,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (1/1) ... [2019-09-07 22:24:02,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:24:02,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:24:02,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:24:02,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:24:02,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (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:24:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:24:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:24:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:24:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:24:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:24:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:24:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:24:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:24:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:24:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:24:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:24:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:24:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:24:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:24:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:24:06,151 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:24:06,151 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:24:06,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:24:06 BoogieIcfgContainer [2019-09-07 22:24:06,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:24:06,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:24:06,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:24:06,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:24:06,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:23:59" (1/3) ... [2019-09-07 22:24:06,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302e49dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:24:06, skipping insertion in model container [2019-09-07 22:24:06,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:01" (2/3) ... [2019-09-07 22:24:06,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302e49dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:24:06, skipping insertion in model container [2019-09-07 22:24:06,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:24:06" (3/3) ... [2019-09-07 22:24:06,170 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label08.c [2019-09-07 22:24:06,184 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:24:06,196 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:24:06,216 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:24:06,280 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:24:06,281 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:24:06,281 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:24:06,282 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:24:06,282 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:24:06,282 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:24:06,282 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:24:06,282 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:24:06,282 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:24:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-07 22:24:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 22:24:06,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:06,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:24:06,340 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash 526679754, now seen corresponding path program 1 times [2019-09-07 22:24:06,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:06,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:06,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:06,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:06,730 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:24:06,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:24:06,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:24:06,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:24:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:24:06,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:24:06,756 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-09-07 22:24:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:13,958 INFO L93 Difference]: Finished difference Result 2970 states and 5743 transitions. [2019-09-07 22:24:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:24:13,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-07 22:24:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:14,001 INFO L225 Difference]: With dead ends: 2970 [2019-09-07 22:24:14,001 INFO L226 Difference]: Without dead ends: 2114 [2019-09-07 22:24:14,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:24:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-09-07 22:24:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1412. [2019-09-07 22:24:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-09-07 22:24:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2246 transitions. [2019-09-07 22:24:14,163 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2246 transitions. Word has length 27 [2019-09-07 22:24:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:14,164 INFO L475 AbstractCegarLoop]: Abstraction has 1412 states and 2246 transitions. [2019-09-07 22:24:14,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:24:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2246 transitions. [2019-09-07 22:24:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 22:24:14,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:14,169 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:24:14,170 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:14,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1096664945, now seen corresponding path program 1 times [2019-09-07 22:24:14,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:14,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:24:14,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:24:14,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:24:14,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:24:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:24:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:24:14,331 INFO L87 Difference]: Start difference. First operand 1412 states and 2246 transitions. Second operand 5 states. [2019-09-07 22:24:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:20,478 INFO L93 Difference]: Finished difference Result 4294 states and 6875 transitions. [2019-09-07 22:24:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:24:20,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-07 22:24:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:20,504 INFO L225 Difference]: With dead ends: 4294 [2019-09-07 22:24:20,504 INFO L226 Difference]: Without dead ends: 2888 [2019-09-07 22:24:20,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:24:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-09-07 22:24:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2866. [2019-09-07 22:24:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2019-09-07 22:24:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4300 transitions. [2019-09-07 22:24:20,618 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4300 transitions. Word has length 96 [2019-09-07 22:24:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:20,619 INFO L475 AbstractCegarLoop]: Abstraction has 2866 states and 4300 transitions. [2019-09-07 22:24:20,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:24:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4300 transitions. [2019-09-07 22:24:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 22:24:20,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:20,630 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:24:20,630 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:20,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1485054039, now seen corresponding path program 1 times [2019-09-07 22:24:20,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:20,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:20,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:20,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:20,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:24:20,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:24:20,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:24:20,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:24:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:24:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:24:20,846 INFO L87 Difference]: Start difference. First operand 2866 states and 4300 transitions. Second operand 6 states. [2019-09-07 22:24:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:26,676 INFO L93 Difference]: Finished difference Result 8752 states and 13417 transitions. [2019-09-07 22:24:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:24:26,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-07 22:24:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:26,719 INFO L225 Difference]: With dead ends: 8752 [2019-09-07 22:24:26,719 INFO L226 Difference]: Without dead ends: 5892 [2019-09-07 22:24:26,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:24:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2019-09-07 22:24:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5837. [2019-09-07 22:24:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-09-07 22:24:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 8644 transitions. [2019-09-07 22:24:26,944 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 8644 transitions. Word has length 100 [2019-09-07 22:24:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:26,944 INFO L475 AbstractCegarLoop]: Abstraction has 5837 states and 8644 transitions. [2019-09-07 22:24:26,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:24:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 8644 transitions. [2019-09-07 22:24:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 22:24:26,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:26,949 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:24:26,949 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash -940092450, now seen corresponding path program 1 times [2019-09-07 22:24:26,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:26,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:26,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:24:27,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:24:27,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:24:27,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:24:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:24:27,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:24:27,169 INFO L87 Difference]: Start difference. First operand 5837 states and 8644 transitions. Second operand 6 states. [2019-09-07 22:24:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:32,418 INFO L93 Difference]: Finished difference Result 14683 states and 22171 transitions. [2019-09-07 22:24:32,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:24:32,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-07 22:24:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:32,473 INFO L225 Difference]: With dead ends: 14683 [2019-09-07 22:24:32,474 INFO L226 Difference]: Without dead ends: 8852 [2019-09-07 22:24:32,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:24:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2019-09-07 22:24:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 8798. [2019-09-07 22:24:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8798 states. [2019-09-07 22:24:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8798 states to 8798 states and 12614 transitions. [2019-09-07 22:24:32,754 INFO L78 Accepts]: Start accepts. Automaton has 8798 states and 12614 transitions. Word has length 121 [2019-09-07 22:24:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:32,755 INFO L475 AbstractCegarLoop]: Abstraction has 8798 states and 12614 transitions. [2019-09-07 22:24:32,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:24:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8798 states and 12614 transitions. [2019-09-07 22:24:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-07 22:24:32,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:32,757 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:24:32,757 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1659967414, now seen corresponding path program 1 times [2019-09-07 22:24:32,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:32,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:32,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:24:32,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:24:32,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:24:32,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:24:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:24:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:24:32,890 INFO L87 Difference]: Start difference. First operand 8798 states and 12614 transitions. Second operand 4 states. [2019-09-07 22:24:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:39,039 INFO L93 Difference]: Finished difference Result 21831 states and 31221 transitions. [2019-09-07 22:24:39,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:24:39,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-07 22:24:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:39,097 INFO L225 Difference]: With dead ends: 21831 [2019-09-07 22:24:39,098 INFO L226 Difference]: Without dead ends: 13039 [2019-09-07 22:24:39,118 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:24:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13039 states. [2019-09-07 22:24:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13039 to 13039. [2019-09-07 22:24:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13039 states. [2019-09-07 22:24:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13039 states to 13039 states and 16597 transitions. [2019-09-07 22:24:39,408 INFO L78 Accepts]: Start accepts. Automaton has 13039 states and 16597 transitions. Word has length 133 [2019-09-07 22:24:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:39,410 INFO L475 AbstractCegarLoop]: Abstraction has 13039 states and 16597 transitions. [2019-09-07 22:24:39,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:24:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13039 states and 16597 transitions. [2019-09-07 22:24:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-07 22:24:39,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:39,417 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:39,418 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash -624053469, now seen corresponding path program 1 times [2019-09-07 22:24:39,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:39,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:39,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:39,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:39,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 22:24:39,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:24:39,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:24:39,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:24:39,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:24:39,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:24:39,559 INFO L87 Difference]: Start difference. First operand 13039 states and 16597 transitions. Second operand 4 states. [2019-09-07 22:24:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:46,199 INFO L93 Difference]: Finished difference Result 46688 states and 61644 transitions. [2019-09-07 22:24:46,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:24:46,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-09-07 22:24:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:46,334 INFO L225 Difference]: With dead ends: 46688 [2019-09-07 22:24:46,334 INFO L226 Difference]: Without dead ends: 33655 [2019-09-07 22:24:46,374 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:24:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33655 states. [2019-09-07 22:24:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33655 to 31538. [2019-09-07 22:24:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31538 states. [2019-09-07 22:24:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31538 states to 31538 states and 40237 transitions. [2019-09-07 22:24:47,270 INFO L78 Accepts]: Start accepts. Automaton has 31538 states and 40237 transitions. Word has length 202 [2019-09-07 22:24:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:47,271 INFO L475 AbstractCegarLoop]: Abstraction has 31538 states and 40237 transitions. [2019-09-07 22:24:47,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:24:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31538 states and 40237 transitions. [2019-09-07 22:24:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 22:24:47,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:47,285 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:47,286 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2069046714, now seen corresponding path program 1 times [2019-09-07 22:24:47,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:47,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:47,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:47,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 22:24:47,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:24:47,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:24:47,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:24:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:24:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:24:47,504 INFO L87 Difference]: Start difference. First operand 31538 states and 40237 transitions. Second operand 4 states. [2019-09-07 22:24:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:24:54,196 INFO L93 Difference]: Finished difference Result 72948 states and 93426 transitions. [2019-09-07 22:24:54,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:24:54,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-09-07 22:24:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:24:54,352 INFO L225 Difference]: With dead ends: 72948 [2019-09-07 22:24:54,352 INFO L226 Difference]: Without dead ends: 41416 [2019-09-07 22:24:54,431 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:24:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41416 states. [2019-09-07 22:24:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41416 to 37195. [2019-09-07 22:24:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37195 states. [2019-09-07 22:24:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37195 states to 37195 states and 44344 transitions. [2019-09-07 22:24:55,166 INFO L78 Accepts]: Start accepts. Automaton has 37195 states and 44344 transitions. Word has length 283 [2019-09-07 22:24:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:24:55,167 INFO L475 AbstractCegarLoop]: Abstraction has 37195 states and 44344 transitions. [2019-09-07 22:24:55,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:24:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 37195 states and 44344 transitions. [2019-09-07 22:24:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-07 22:24:55,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:24:55,191 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:55,191 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:24:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:24:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1501512014, now seen corresponding path program 1 times [2019-09-07 22:24:55,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:24:55,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:24:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:55,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:55,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:24:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:24:55,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:24:55,584 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:24:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:24:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:24:55,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 22:24:55,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:24:55,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:24:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 22:24:56,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:24:56,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 22:24:56,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:24:56,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:24:56,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:24:56,382 INFO L87 Difference]: Start difference. First operand 37195 states and 44344 transitions. Second operand 9 states. [2019-09-07 22:25:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:25:13,780 INFO L93 Difference]: Finished difference Result 109045 states and 139900 transitions. [2019-09-07 22:25:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 22:25:13,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 411 [2019-09-07 22:25:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:25:14,093 INFO L225 Difference]: With dead ends: 109045 [2019-09-07 22:25:14,093 INFO L226 Difference]: Without dead ends: 71856 [2019-09-07 22:25:14,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 22:25:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71856 states. [2019-09-07 22:25:15,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71856 to 68526. [2019-09-07 22:25:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68526 states. [2019-09-07 22:25:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68526 states to 68526 states and 83471 transitions. [2019-09-07 22:25:15,757 INFO L78 Accepts]: Start accepts. Automaton has 68526 states and 83471 transitions. Word has length 411 [2019-09-07 22:25:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:25:15,758 INFO L475 AbstractCegarLoop]: Abstraction has 68526 states and 83471 transitions. [2019-09-07 22:25:15,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:25:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68526 states and 83471 transitions. [2019-09-07 22:25:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-07 22:25:15,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:25:15,811 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:25:15,811 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:25:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:25:15,811 INFO L82 PathProgramCache]: Analyzing trace with hash 458996051, now seen corresponding path program 1 times [2019-09-07 22:25:15,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:25:15,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:25:15,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:25:15,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:25:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:25:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:25:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 80 proven. 331 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-09-07 22:25:17,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:25:17,482 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:25:17,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:25:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:25:17,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:25:17,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:25:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2019-09-07 22:25:17,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:25:17,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 22:25:17,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:25:17,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:25:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:25:17,833 INFO L87 Difference]: Start difference. First operand 68526 states and 83471 transitions. Second operand 9 states. [2019-09-07 22:25:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:25:25,098 INFO L93 Difference]: Finished difference Result 139991 states and 171139 transitions. [2019-09-07 22:25:25,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 22:25:25,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 556 [2019-09-07 22:25:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:25:25,277 INFO L225 Difference]: With dead ends: 139991 [2019-09-07 22:25:25,278 INFO L226 Difference]: Without dead ends: 68615 [2019-09-07 22:25:25,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 563 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:25:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68615 states. [2019-09-07 22:25:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68615 to 60811. [2019-09-07 22:25:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60811 states. [2019-09-07 22:25:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60811 states to 60811 states and 70492 transitions. [2019-09-07 22:25:26,425 INFO L78 Accepts]: Start accepts. Automaton has 60811 states and 70492 transitions. Word has length 556 [2019-09-07 22:25:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:25:26,425 INFO L475 AbstractCegarLoop]: Abstraction has 60811 states and 70492 transitions. [2019-09-07 22:25:26,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:25:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 60811 states and 70492 transitions. [2019-09-07 22:25:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-09-07 22:25:26,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:25:26,488 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:26,488 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:25:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:25:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1907923568, now seen corresponding path program 1 times [2019-09-07 22:25:26,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:25:26,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:25:26,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:25:26,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:25:26,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:25:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:25:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 315 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 22:25:27,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:25:27,324 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) [2019-09-07 22:25:27,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:25:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:25:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:25:27,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:25:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-09-07 22:25:27,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:25:27,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 22:25:27,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:25:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:25:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:25:27,935 INFO L87 Difference]: Start difference. First operand 60811 states and 70492 transitions. Second operand 9 states. [2019-09-07 22:25:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:25:34,608 INFO L93 Difference]: Finished difference Result 131867 states and 154930 transitions. [2019-09-07 22:25:34,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 22:25:34,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 696 [2019-09-07 22:25:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:25:34,752 INFO L225 Difference]: With dead ends: 131867 [2019-09-07 22:25:34,752 INFO L226 Difference]: Without dead ends: 71062 [2019-09-07 22:25:34,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:25:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71062 states. [2019-09-07 22:25:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71062 to 67228. [2019-09-07 22:25:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67228 states. [2019-09-07 22:25:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67228 states to 67228 states and 76284 transitions. [2019-09-07 22:25:38,035 INFO L78 Accepts]: Start accepts. Automaton has 67228 states and 76284 transitions. Word has length 696 [2019-09-07 22:25:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:25:38,036 INFO L475 AbstractCegarLoop]: Abstraction has 67228 states and 76284 transitions. [2019-09-07 22:25:38,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:25:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 67228 states and 76284 transitions. [2019-09-07 22:25:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-09-07 22:25:38,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:25:38,093 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:38,094 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:25:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:25:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash 162587012, now seen corresponding path program 1 times [2019-09-07 22:25:38,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:25:38,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:25:38,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:25:38,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:25:38,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:25:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:25:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 576 proven. 2 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2019-09-07 22:25:38,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:25:38,642 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:25:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:25:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:25:38,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:25:38,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:25:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 576 proven. 2 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-07 22:25:39,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:25:39,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 22:25:39,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:25:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:25:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:25:39,511 INFO L87 Difference]: Start difference. First operand 67228 states and 76284 transitions. Second operand 6 states. [2019-09-07 22:25:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:25:46,204 INFO L93 Difference]: Finished difference Result 138621 states and 158749 transitions. [2019-09-07 22:25:46,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 22:25:46,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 803 [2019-09-07 22:25:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:25:46,330 INFO L225 Difference]: With dead ends: 138621 [2019-09-07 22:25:46,330 INFO L226 Difference]: Without dead ends: 71399 [2019-09-07 22:25:46,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:25:46,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71399 states. [2019-09-07 22:25:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71399 to 71303. [2019-09-07 22:25:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71303 states. [2019-09-07 22:25:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71303 states to 71303 states and 81272 transitions. [2019-09-07 22:25:47,367 INFO L78 Accepts]: Start accepts. Automaton has 71303 states and 81272 transitions. Word has length 803 [2019-09-07 22:25:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:25:47,369 INFO L475 AbstractCegarLoop]: Abstraction has 71303 states and 81272 transitions. [2019-09-07 22:25:47,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:25:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 71303 states and 81272 transitions. [2019-09-07 22:25:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2019-09-07 22:25:47,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:25:47,466 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:47,467 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:25:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:25:47,468 INFO L82 PathProgramCache]: Analyzing trace with hash 924058144, now seen corresponding path program 1 times [2019-09-07 22:25:47,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:25:47,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:25:47,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:25:47,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:25:47,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:25:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:25:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 208 proven. 365 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2019-09-07 22:25:49,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:25:49,978 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:25:49,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:25:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:25:50,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:25:50,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:25:50,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:25:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 528 proven. 2 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2019-09-07 22:25:51,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:25:51,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 22:25:51,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:25:51,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:25:51,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:25:51,920 INFO L87 Difference]: Start difference. First operand 71303 states and 81272 transitions. Second operand 15 states. [2019-09-07 22:26:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:26:12,939 INFO L93 Difference]: Finished difference Result 167739 states and 199229 transitions. [2019-09-07 22:26:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 22:26:12,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 984 [2019-09-07 22:26:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:26:13,150 INFO L225 Difference]: With dead ends: 167739 [2019-09-07 22:26:13,150 INFO L226 Difference]: Without dead ends: 96442 [2019-09-07 22:26:13,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 1019 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 22:26:13,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96442 states. [2019-09-07 22:26:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96442 to 89900. [2019-09-07 22:26:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89900 states. [2019-09-07 22:26:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89900 states to 89900 states and 101854 transitions. [2019-09-07 22:26:14,446 INFO L78 Accepts]: Start accepts. Automaton has 89900 states and 101854 transitions. Word has length 984 [2019-09-07 22:26:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:26:14,447 INFO L475 AbstractCegarLoop]: Abstraction has 89900 states and 101854 transitions. [2019-09-07 22:26:14,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:26:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 89900 states and 101854 transitions. [2019-09-07 22:26:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2019-09-07 22:26:14,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:26:14,541 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:26:14,542 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:26:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:26:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash -75774813, now seen corresponding path program 1 times [2019-09-07 22:26:14,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:26:14,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:26:14,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:26:14,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:26:14,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:26:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:26:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 595 proven. 164 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-09-07 22:26:16,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:26:16,394 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:26:16,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:26:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:26:16,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:26:16,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:26:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 1010 proven. 5 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-07 22:26:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:26:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:26:18,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:26:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:26:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:26:18,585 INFO L87 Difference]: Start difference. First operand 89900 states and 101854 transitions. Second operand 9 states. [2019-09-07 22:26:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:26:26,632 INFO L93 Difference]: Finished difference Result 192007 states and 219710 transitions. [2019-09-07 22:26:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:26:26,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1120 [2019-09-07 22:26:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:26:26,914 INFO L225 Difference]: With dead ends: 192007 [2019-09-07 22:26:26,915 INFO L226 Difference]: Without dead ends: 102113 [2019-09-07 22:26:27,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 1127 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:26:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102113 states. [2019-09-07 22:26:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102113 to 101966. [2019-09-07 22:26:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101966 states. [2019-09-07 22:26:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101966 states to 101966 states and 114056 transitions. [2019-09-07 22:26:28,506 INFO L78 Accepts]: Start accepts. Automaton has 101966 states and 114056 transitions. Word has length 1120 [2019-09-07 22:26:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:26:28,508 INFO L475 AbstractCegarLoop]: Abstraction has 101966 states and 114056 transitions. [2019-09-07 22:26:28,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:26:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 101966 states and 114056 transitions. [2019-09-07 22:26:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1403 [2019-09-07 22:26:28,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:26:28,633 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:26:28,633 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:26:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:26:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1530376087, now seen corresponding path program 1 times [2019-09-07 22:26:28,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:26:28,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:26:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:26:28,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:26:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:26:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:26:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2103 backedges. 293 proven. 221 refuted. 0 times theorem prover too weak. 1589 trivial. 0 not checked. [2019-09-07 22:26:30,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:26:30,089 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:26:30,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:26:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:26:30,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:26:30,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:26:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2103 backedges. 1494 proven. 2 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-09-07 22:26:32,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:26:32,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:26:32,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:26:32,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:26:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:26:32,500 INFO L87 Difference]: Start difference. First operand 101966 states and 114056 transitions. Second operand 9 states. [2019-09-07 22:26:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:26:44,051 INFO L93 Difference]: Finished difference Result 225045 states and 255293 transitions. [2019-09-07 22:26:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 22:26:44,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1402 [2019-09-07 22:26:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:26:44,261 INFO L225 Difference]: With dead ends: 225045 [2019-09-07 22:26:44,262 INFO L226 Difference]: Without dead ends: 109985 [2019-09-07 22:26:44,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1429 GetRequests, 1410 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-09-07 22:26:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109985 states. [2019-09-07 22:26:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109985 to 105695. [2019-09-07 22:26:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105695 states. [2019-09-07 22:26:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105695 states to 105695 states and 112734 transitions. [2019-09-07 22:26:45,751 INFO L78 Accepts]: Start accepts. Automaton has 105695 states and 112734 transitions. Word has length 1402 [2019-09-07 22:26:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:26:45,751 INFO L475 AbstractCegarLoop]: Abstraction has 105695 states and 112734 transitions. [2019-09-07 22:26:45,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:26:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 105695 states and 112734 transitions. [2019-09-07 22:26:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1447 [2019-09-07 22:26:45,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:26:45,833 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:26:45,833 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:26:45,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:26:45,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1282797631, now seen corresponding path program 1 times [2019-09-07 22:26:45,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:26:45,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:26:45,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:26:45,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:26:45,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:26:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:26:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 388 proven. 1206 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2019-09-07 22:26:48,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:26:48,877 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:26:48,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:26:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:26:49,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1838 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 22:26:49,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:26:49,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:26:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2019-09-07 22:26:51,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:26:51,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 22:26:51,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:26:51,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:26:51,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:26:51,609 INFO L87 Difference]: Start difference. First operand 105695 states and 112734 transitions. Second operand 11 states. [2019-09-07 22:27:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:27:08,591 INFO L93 Difference]: Finished difference Result 236930 states and 251838 transitions. [2019-09-07 22:27:08,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 22:27:08,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1446 [2019-09-07 22:27:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:27:08,860 INFO L225 Difference]: With dead ends: 236930 [2019-09-07 22:27:08,861 INFO L226 Difference]: Without dead ends: 131943 [2019-09-07 22:27:08,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1528 GetRequests, 1483 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=1806, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 22:27:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131943 states. [2019-09-07 22:27:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131943 to 126955. [2019-09-07 22:27:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126955 states. [2019-09-07 22:27:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126955 states to 126955 states and 133796 transitions. [2019-09-07 22:27:10,209 INFO L78 Accepts]: Start accepts. Automaton has 126955 states and 133796 transitions. Word has length 1446 [2019-09-07 22:27:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:27:10,210 INFO L475 AbstractCegarLoop]: Abstraction has 126955 states and 133796 transitions. [2019-09-07 22:27:10,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:27:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 126955 states and 133796 transitions. [2019-09-07 22:27:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1905 [2019-09-07 22:27:10,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:27:10,309 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:10,309 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:27:10,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:27:10,310 INFO L82 PathProgramCache]: Analyzing trace with hash -790183917, now seen corresponding path program 1 times [2019-09-07 22:27:10,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:27:10,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:27:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:27:10,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:27:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:27:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:27:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3855 backedges. 911 proven. 1562 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2019-09-07 22:27:15,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:27:15,639 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:27:15,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:27:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:27:16,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 2417 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:27:16,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:27:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3855 backedges. 2577 proven. 2 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-07 22:27:17,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:27:17,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 22:27:17,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 22:27:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 22:27:17,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-09-07 22:27:17,376 INFO L87 Difference]: Start difference. First operand 126955 states and 133796 transitions. Second operand 21 states. [2019-09-07 22:27:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:27:39,578 INFO L93 Difference]: Finished difference Result 253530 states and 268462 transitions. [2019-09-07 22:27:39,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-07 22:27:39,578 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1904 [2019-09-07 22:27:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:27:39,812 INFO L225 Difference]: With dead ends: 253530 [2019-09-07 22:27:39,813 INFO L226 Difference]: Without dead ends: 127993 [2019-09-07 22:27:39,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2098 GetRequests, 1987 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4299 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1826, Invalid=10384, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 22:27:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127993 states. [2019-09-07 22:27:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127993 to 119850. [2019-09-07 22:27:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119850 states. [2019-09-07 22:27:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119850 states to 119850 states and 124779 transitions. [2019-09-07 22:27:41,622 INFO L78 Accepts]: Start accepts. Automaton has 119850 states and 124779 transitions. Word has length 1904 [2019-09-07 22:27:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:27:41,623 INFO L475 AbstractCegarLoop]: Abstraction has 119850 states and 124779 transitions. [2019-09-07 22:27:41,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 22:27:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 119850 states and 124779 transitions. [2019-09-07 22:27:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1916 [2019-09-07 22:27:41,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:27:41,714 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:27:41,714 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:27:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:27:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1183992540, now seen corresponding path program 1 times [2019-09-07 22:27:41,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:27:41,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:27:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:27:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:27:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:27:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:27:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 328 proven. 269 refuted. 0 times theorem prover too weak. 2448 trivial. 0 not checked. [2019-09-07 22:27:44,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:27:44,035 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:27:44,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:27:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:27:44,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 2369 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 22:27:44,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:27:44,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:27:44,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:27:44,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:27:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 2359 proven. 2 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:27:48,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:27:48,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:27:48,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:27:48,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:27:48,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:27:48,331 INFO L87 Difference]: Start difference. First operand 119850 states and 124779 transitions. Second operand 8 states. [2019-09-07 22:27:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:27:57,259 INFO L93 Difference]: Finished difference Result 258682 states and 270046 transitions. [2019-09-07 22:27:57,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 22:27:57,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1915 [2019-09-07 22:27:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:27:57,589 INFO L225 Difference]: With dead ends: 258682 [2019-09-07 22:27:57,589 INFO L226 Difference]: Without dead ends: 140250 [2019-09-07 22:27:57,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1943 GetRequests, 1925 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-09-07 22:27:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140250 states. [2019-09-07 22:27:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140250 to 136004. [2019-09-07 22:27:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136004 states. [2019-09-07 22:27:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136004 states to 136004 states and 141441 transitions. [2019-09-07 22:27:59,396 INFO L78 Accepts]: Start accepts. Automaton has 136004 states and 141441 transitions. Word has length 1915 [2019-09-07 22:27:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:27:59,397 INFO L475 AbstractCegarLoop]: Abstraction has 136004 states and 141441 transitions. [2019-09-07 22:27:59,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:27:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 136004 states and 141441 transitions. [2019-09-07 22:27:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2080 [2019-09-07 22:27:59,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:27:59,966 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:27:59,966 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:27:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:27:59,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1575824208, now seen corresponding path program 1 times [2019-09-07 22:27:59,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:27:59,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:27:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:27:59,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:27:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:28:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:28:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3996 backedges. 441 proven. 2990 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2019-09-07 22:28:08,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:28:08,936 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:28:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:28:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:28:09,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 2571 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 22:28:09,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:28:09,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:28:09,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:28:09,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:28:09,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:28:17,685 WARN L188 SmtUtils]: Spent 8.07 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-07 22:28:17,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:28:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:28:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3996 backedges. 3200 proven. 6 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2019-09-07 22:28:19,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:28:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 25 [2019-09-07 22:28:19,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 22:28:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 22:28:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-09-07 22:28:19,955 INFO L87 Difference]: Start difference. First operand 136004 states and 141441 transitions. Second operand 25 states. [2019-09-07 22:28:55,519 WARN L188 SmtUtils]: Spent 22.33 s on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-09-07 22:29:14,238 WARN L188 SmtUtils]: Spent 18.64 s on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-07 22:29:38,479 WARN L188 SmtUtils]: Spent 16.51 s on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-07 22:30:01,736 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-07 22:30:24,529 WARN L188 SmtUtils]: Spent 22.34 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-07 22:30:30,524 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-07 22:31:15,664 WARN L188 SmtUtils]: Spent 19.53 s on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-07 22:31:18,430 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-07 22:31:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:31:26,158 INFO L93 Difference]: Finished difference Result 304876 states and 317619 transitions. [2019-09-07 22:31:26,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-07 22:31:26,159 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 2079 [2019-09-07 22:31:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:31:26,446 INFO L225 Difference]: With dead ends: 304876 [2019-09-07 22:31:26,446 INFO L226 Difference]: Without dead ends: 170290 [2019-09-07 22:31:26,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2294 GetRequests, 2169 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5443 ImplicationChecksByTransitivity, 114.3s TimeCoverageRelationStatistics Valid=2243, Invalid=13257, Unknown=0, NotChecked=0, Total=15500 [2019-09-07 22:31:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170290 states. [2019-09-07 22:31:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170290 to 162422. [2019-09-07 22:31:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162422 states. [2019-09-07 22:31:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162422 states to 162422 states and 168068 transitions. [2019-09-07 22:31:28,602 INFO L78 Accepts]: Start accepts. Automaton has 162422 states and 168068 transitions. Word has length 2079 [2019-09-07 22:31:28,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:31:28,603 INFO L475 AbstractCegarLoop]: Abstraction has 162422 states and 168068 transitions. [2019-09-07 22:31:28,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 22:31:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 162422 states and 168068 transitions. [2019-09-07 22:31:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2019-09-07 22:31:28,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:31:28,738 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:31:28,738 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:31:28,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:31:28,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1393795415, now seen corresponding path program 1 times [2019-09-07 22:31:28,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:31:28,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:31:28,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:28,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:28,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 22:31:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 22:31:29,508 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Int term has non-integral value at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:66) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:745) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:108) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1090) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.getValues(SmtUtils.java:1813) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getValue(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 22:31:29,515 INFO L168 Benchmark]: Toolchain (without parser) took 449656.18 ms. Allocated memory was 137.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 84.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-09-07 22:31:29,516 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 137.9 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 22:31:29,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1899.34 ms. Allocated memory was 137.9 MB in the beginning and 233.3 MB in the end (delta: 95.4 MB). Free memory was 84.5 MB in the beginning and 99.0 MB in the end (delta: -14.5 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-09-07 22:31:29,522 INFO L168 Benchmark]: Boogie Preprocessor took 293.92 ms. Allocated memory was 233.3 MB in the beginning and 242.7 MB in the end (delta: 9.4 MB). Free memory was 99.0 MB in the beginning and 188.1 MB in the end (delta: -89.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-09-07 22:31:29,523 INFO L168 Benchmark]: RCFGBuilder took 4098.18 ms. Allocated memory was 242.7 MB in the beginning and 310.9 MB in the end (delta: 68.2 MB). Free memory was 188.1 MB in the beginning and 169.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 175.3 MB. Max. memory is 7.1 GB. [2019-09-07 22:31:29,524 INFO L168 Benchmark]: TraceAbstraction took 443357.93 ms. Allocated memory was 310.9 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 169.4 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-09-07 22:31:29,536 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 137.9 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1899.34 ms. Allocated memory was 137.9 MB in the beginning and 233.3 MB in the end (delta: 95.4 MB). Free memory was 84.5 MB in the beginning and 99.0 MB in the end (delta: -14.5 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 293.92 ms. Allocated memory was 233.3 MB in the beginning and 242.7 MB in the end (delta: 9.4 MB). Free memory was 99.0 MB in the beginning and 188.1 MB in the end (delta: -89.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4098.18 ms. Allocated memory was 242.7 MB in the beginning and 310.9 MB in the end (delta: 68.2 MB). Free memory was 188.1 MB in the beginning and 169.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 175.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 443357.93 ms. Allocated memory was 310.9 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 169.4 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Int term has non-integral value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Int term has non-integral value: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...