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/loop-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:34:35,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:34:35,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:34:35,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:34:35,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:34:35,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:34:35,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:34:35,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:34:35,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:34:35,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:34:35,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:34:35,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:34:35,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:34:35,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:34:35,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:34:35,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:34:35,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:34:35,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:34:35,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:34:35,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:34:35,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:34:35,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:34:35,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:34:35,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:34:35,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:34:35,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:34:35,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:34:35,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:34:35,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:34:35,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:34:35,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:34:35,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:34:35,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:34:35,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:34:35,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:34:35,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:34:35,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:34:35,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:34:35,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:34:35,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:34:35,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:34:35,884 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-03 19:34:35,898 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:34:35,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:34:35,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:34:35,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:34:35,900 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:34:35,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:34:35,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:34:35,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:34:35,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:34:35,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:34:35,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:34:35,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:34:35,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:34:35,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:34:35,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:34:35,902 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:34:35,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:34:35,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:34:35,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:34:35,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:34:35,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:34:35,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:34:35,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:34:35,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:34:35,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:34:35,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:34:35,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:34:35,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:34:35,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:34:35,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:34:35,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:34:35,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:34:35,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:34:35,951 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:34:35,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-09-03 19:34:36,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01c36cd7/c574f9d8ea9540dd8bfa34ce2b8f2736/FLAG1b138bc9f [2019-09-03 19:34:36,450 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:34:36,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-09-03 19:34:36,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01c36cd7/c574f9d8ea9540dd8bfa34ce2b8f2736/FLAG1b138bc9f [2019-09-03 19:34:36,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01c36cd7/c574f9d8ea9540dd8bfa34ce2b8f2736 [2019-09-03 19:34:36,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:34:36,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:34:36,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:34:36,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:34:36,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:34:36,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:34:36" (1/1) ... [2019-09-03 19:34:36,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5748c03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:36, skipping insertion in model container [2019-09-03 19:34:36,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:34:36" (1/1) ... [2019-09-03 19:34:36,888 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:34:36,908 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:34:37,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:34:37,127 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:34:37,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:34:37,164 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:34:37,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37 WrapperNode [2019-09-03 19:34:37,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:34:37,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:34:37,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:34:37,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:34:37,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (1/1) ... [2019-09-03 19:34:37,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (1/1) ... [2019-09-03 19:34:37,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (1/1) ... [2019-09-03 19:34:37,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (1/1) ... [2019-09-03 19:34:37,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (1/1) ... [2019-09-03 19:34:37,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (1/1) ... [2019-09-03 19:34:37,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (1/1) ... [2019-09-03 19:34:37,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:34:37,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:34:37,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:34:37,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:34:37,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:34:37,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:34:37,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:34:37,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:34:37,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:34:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:34:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:34:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:34:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:34:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:34:37,500 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:34:37,500 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:34:37,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:34:37 BoogieIcfgContainer [2019-09-03 19:34:37,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:34:37,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:34:37,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:34:37,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:34:37,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:34:36" (1/3) ... [2019-09-03 19:34:37,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584b7862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:34:37, skipping insertion in model container [2019-09-03 19:34:37,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:34:37" (2/3) ... [2019-09-03 19:34:37,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584b7862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:34:37, skipping insertion in model container [2019-09-03 19:34:37,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:34:37" (3/3) ... [2019-09-03 19:34:37,509 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2019-09-03 19:34:37,519 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:34:37,526 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:34:37,543 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:34:37,573 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:34:37,574 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:34:37,574 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:34:37,574 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:34:37,574 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:34:37,574 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:34:37,575 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:34:37,575 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:34:37,575 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:34:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 19:34:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:34:37,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:37,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:37,599 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:37,605 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2019-09-03 19:34:37,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:37,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:37,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:37,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:37,811 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-03 19:34:37,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:34:37,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:34:37,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:34:37,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:34:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:34:37,846 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-09-03 19:34:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:37,891 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-09-03 19:34:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:34:37,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:34:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:37,902 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:34:37,902 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:34:37,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:34:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:34:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-03 19:34:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:34:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 19:34:37,943 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 19:34:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:37,944 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 19:34:37,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:34:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 19:34:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:34:37,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:37,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:37,945 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2019-09-03 19:34:37,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:37,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:37,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:38,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:34:38,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:34:38,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:34:38,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:34:38,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:34:38,029 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-03 19:34:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:38,063 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-09-03 19:34:38,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:34:38,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 19:34:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:38,066 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:34:38,066 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 19:34:38,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:34:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 19:34:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 19:34:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:34:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-03 19:34:38,073 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-03 19:34:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:38,073 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-03 19:34:38,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:34:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-03 19:34:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:34:38,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:38,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:38,074 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2019-09-03 19:34:38,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:38,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:38,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:38,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:38,186 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-03 19:34:38,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:38,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:34:38,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:34:38,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:38,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-03 19:34:38,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:34:38,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:34:38,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:34:38,311 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-03 19:34:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:38,437 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-09-03 19:34:38,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:34:38,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-03 19:34:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:38,439 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:34:38,439 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:34:38,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:34:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:34:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-09-03 19:34:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:34:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-03 19:34:38,446 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-09-03 19:34:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:38,446 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-03 19:34:38,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:34:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-03 19:34:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:34:38,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:38,448 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:38,448 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:38,448 INFO L82 PathProgramCache]: Analyzing trace with hash 93409041, now seen corresponding path program 2 times [2019-09-03 19:34:38,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:38,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:38,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 19:34:38,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:38,552 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-03 19:34:38,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:34:38,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:38,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:38,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:34:38,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:34:38,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:38,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-03 19:34:38,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:34:38,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:34:38,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:34:38,640 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 8 states. [2019-09-03 19:34:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:38,906 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-03 19:34:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:34:38,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-03 19:34:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:38,908 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:34:38,908 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:34:38,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:34:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:34:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-09-03 19:34:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:34:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-03 19:34:38,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-03 19:34:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:38,920 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-03 19:34:38,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:34:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-03 19:34:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:34:38,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:38,921 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:38,921 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:38,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash 50981508, now seen corresponding path program 3 times [2019-09-03 19:34:38,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:38,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:38,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-03 19:34:39,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:39,080 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-03 19:34:39,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:39,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:34:39,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:39,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:34:39,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:34:39,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:39,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:34:39,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:34:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:34:39,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:34:39,176 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2019-09-03 19:34:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:39,216 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-03 19:34:39,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:34:39,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-03 19:34:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:39,218 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:34:39,218 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:34:39,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:34:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:34:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 19:34:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:34:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-09-03 19:34:39,226 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 28 [2019-09-03 19:34:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:39,226 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-09-03 19:34:39,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:34:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-09-03 19:34:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:34:39,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:39,228 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:39,228 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1418818136, now seen corresponding path program 4 times [2019-09-03 19:34:39,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:39,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:39,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:39,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:39,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 53 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 19:34:39,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:39,351 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-03 19:34:39,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:34:39,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:39,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:39,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:34:39,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 19:34:39,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:39,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-09-03 19:34:39,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:34:39,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:34:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:34:39,540 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 15 states. [2019-09-03 19:34:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:39,985 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2019-09-03 19:34:39,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:34:39,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2019-09-03 19:34:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:39,987 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:34:39,987 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:34:39,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:34:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:34:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-09-03 19:34:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:34:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 19:34:39,998 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 31 [2019-09-03 19:34:39,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:39,998 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 19:34:39,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:34:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 19:34:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:34:40,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:40,000 INFO L399 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:40,000 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:40,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1949427083, now seen corresponding path program 5 times [2019-09-03 19:34:40,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:40,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:40,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:40,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:40,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-03 19:34:40,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:40,161 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-03 19:34:40,179 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:34:40,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:34:40,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:40,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:34:40,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 189 proven. 15 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-03 19:34:40,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:40,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:34:40,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:34:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:34:40,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:34:40,263 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2019-09-03 19:34:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:40,310 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2019-09-03 19:34:40,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:34:40,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-09-03 19:34:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:40,313 INFO L225 Difference]: With dead ends: 78 [2019-09-03 19:34:40,313 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:34:40,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:34:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:34:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 19:34:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:34:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-03 19:34:40,322 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 42 [2019-09-03 19:34:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:40,322 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-03 19:34:40,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:34:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-03 19:34:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:34:40,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:40,324 INFO L399 BasicCegarLoop]: trace histogram [24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:40,324 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash -649475471, now seen corresponding path program 6 times [2019-09-03 19:34:40,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:40,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:40,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:40,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:40,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 19:34:40,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:40,479 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) [2019-09-03 19:34:40,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:40,572 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-03 19:34:40,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:40,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:34:40,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 254 proven. 21 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-03 19:34:40,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:40,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:34:40,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:34:40,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:34:40,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:34:40,615 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 10 states. [2019-09-03 19:34:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:40,687 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2019-09-03 19:34:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:34:40,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-09-03 19:34:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:40,693 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:34:40,694 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:34:40,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:34:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:34:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-03 19:34:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:34:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-03 19:34:40,707 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 46 [2019-09-03 19:34:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:40,707 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-03 19:34:40,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:34:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-03 19:34:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:34:40,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:40,710 INFO L399 BasicCegarLoop]: trace histogram [28, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:40,710 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1892649995, now seen corresponding path program 7 times [2019-09-03 19:34:40,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:40,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:40,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:40,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:40,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-03 19:34:40,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:40,880 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-03 19:34:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:40,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:34:40,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-03 19:34:41,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:41,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-03 19:34:41,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:34:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:34:41,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:34:41,109 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 20 states. [2019-09-03 19:34:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:42,103 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2019-09-03 19:34:42,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:34:42,104 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2019-09-03 19:34:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:42,105 INFO L225 Difference]: With dead ends: 113 [2019-09-03 19:34:42,105 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 19:34:42,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=2706, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:34:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 19:34:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2019-09-03 19:34:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 19:34:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-09-03 19:34:42,117 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 50 [2019-09-03 19:34:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:42,117 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-09-03 19:34:42,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:34:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-09-03 19:34:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-03 19:34:42,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:42,119 INFO L399 BasicCegarLoop]: trace histogram [40, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:42,119 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1564944312, now seen corresponding path program 8 times [2019-09-03 19:34:42,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:42,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:42,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:42,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:34:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-03 19:34:42,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:42,266 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) [2019-09-03 19:34:42,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:34:42,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:34:42,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:42,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:34:42,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-03 19:34:42,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:42,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2019-09-03 19:34:42,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:34:42,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:34:42,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:34:42,539 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 23 states. [2019-09-03 19:34:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:43,957 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2019-09-03 19:34:43,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:34:43,958 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2019-09-03 19:34:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:43,959 INFO L225 Difference]: With dead ends: 145 [2019-09-03 19:34:43,960 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 19:34:43,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=4619, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:34:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 19:34:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2019-09-03 19:34:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 19:34:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-09-03 19:34:43,974 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 65 [2019-09-03 19:34:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:43,974 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-09-03 19:34:43,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:34:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-09-03 19:34:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 19:34:43,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:43,976 INFO L399 BasicCegarLoop]: trace histogram [54, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:43,976 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:43,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1497018839, now seen corresponding path program 9 times [2019-09-03 19:34:43,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:43,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:43,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:43,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:43,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2019-09-03 19:34:44,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:44,140 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-03 19:34:44,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:34:44,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:34:44,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:44,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:34:44,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 511 proven. 45 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-09-03 19:34:44,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:44,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:34:44,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:34:44,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:34:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:34:44,439 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 13 states. [2019-09-03 19:34:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:44,515 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2019-09-03 19:34:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:34:44,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-09-03 19:34:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:44,517 INFO L225 Difference]: With dead ends: 156 [2019-09-03 19:34:44,517 INFO L226 Difference]: Without dead ends: 89 [2019-09-03 19:34:44,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:34:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-03 19:34:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-03 19:34:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 19:34:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-09-03 19:34:44,543 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 82 [2019-09-03 19:34:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:44,545 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-09-03 19:34:44,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:34:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-09-03 19:34:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:34:44,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:44,549 INFO L399 BasicCegarLoop]: trace histogram [60, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:44,549 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:44,550 INFO L82 PathProgramCache]: Analyzing trace with hash 642319569, now seen corresponding path program 10 times [2019-09-03 19:34:44,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:44,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:44,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:44,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:44,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 0 proven. 1851 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-03 19:34:44,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:44,743 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-03 19:34:44,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:34:44,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:34:44,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:34:44,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:34:44,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:34:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 0 proven. 1900 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-09-03 19:34:44,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:34:44,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 17 [2019-09-03 19:34:44,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:34:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:34:44,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:34:44,958 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 17 states. [2019-09-03 19:34:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:34:45,157 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-09-03 19:34:45,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:34:45,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-03 19:34:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:34:45,159 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:34:45,159 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:34:45,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:34:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:34:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-09-03 19:34:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 19:34:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-09-03 19:34:45,173 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 88 [2019-09-03 19:34:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:34:45,174 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-09-03 19:34:45,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:34:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-09-03 19:34:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-03 19:34:45,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:34:45,176 INFO L399 BasicCegarLoop]: trace histogram [70, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:34:45,176 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:34:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:34:45,176 INFO L82 PathProgramCache]: Analyzing trace with hash -284489192, now seen corresponding path program 11 times [2019-09-03 19:34:45,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:34:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:34:45,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:45,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:34:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:34:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:34:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 0 proven. 2590 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-09-03 19:34:45,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:34:45,381 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) [2019-09-03 19:34:45,402 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:31,271 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-09-03 19:36:31,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:32,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:36:32,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 0 proven. 2642 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-09-03 19:36:32,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:36:32,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 19 [2019-09-03 19:36:32,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:36:32,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:36:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:36:32,309 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 19 states. [2019-09-03 19:36:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:36:32,690 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2019-09-03 19:36:32,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:36:32,696 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-09-03 19:36:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:36:32,697 INFO L225 Difference]: With dead ends: 132 [2019-09-03 19:36:32,697 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 19:36:32,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:36:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 19:36:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-03 19:36:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 19:36:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-09-03 19:36:32,711 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 101 [2019-09-03 19:36:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:36:32,712 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-09-03 19:36:32,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:36:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-09-03 19:36:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 19:36:32,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:36:32,714 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:36:32,714 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:36:32,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:36:32,714 INFO L82 PathProgramCache]: Analyzing trace with hash -352579535, now seen corresponding path program 12 times [2019-09-03 19:36:32,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:36:32,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:36:32,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:32,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:36:32,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:36:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:36:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3452 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-03 19:36:32,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:36:32,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:36:32,928 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:36:36,903 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:36:36,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:36:36,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:36:36,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:36:36,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:36:36,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:36:36,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:36:36,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:36:36,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:36:51,312 WARN L188 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-09-03 19:36:55,367 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-03 19:36:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 862 proven. 0 refuted. 0 times theorem prover too weak. 3030 trivial. 0 not checked. [2019-09-03 19:36:57,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:36:57,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-03 19:36:57,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:36:57,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:36:57,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=184, Unknown=2, NotChecked=0, Total=240 [2019-09-03 19:36:57,471 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 16 states. [2019-09-03 19:37:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:01,249 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2019-09-03 19:37:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:37:01,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 114 [2019-09-03 19:37:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:01,250 INFO L225 Difference]: With dead ends: 144 [2019-09-03 19:37:01,251 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:37:01,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=82, Invalid=258, Unknown=2, NotChecked=0, Total=342 [2019-09-03 19:37:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:37:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:37:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:37:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:37:01,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2019-09-03 19:37:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:01,253 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:37:01,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:37:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:37:01,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:37:01,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:37:01,502 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 56 [2019-09-03 19:37:01,649 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 19:37:01,650 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:37:01,650 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:37:01,650 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:37:01,650 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:37:01,651 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:37:01,651 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 25) no Hoare annotation was computed. [2019-09-03 19:37:01,651 INFO L439 ceAbstractionStarter]: At program point L17-2(lines 17 19) the Hoare annotation is: (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455))) [2019-09-03 19:37:01,651 INFO L443 ceAbstractionStarter]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2019-09-03 19:37:01,651 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 25) no Hoare annotation was computed. [2019-09-03 19:37:01,652 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 25) the Hoare annotation is: true [2019-09-03 19:37:01,652 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 22) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (and (<= 0 main_~y~0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2019-09-03 19:37:01,652 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 22) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296))) [2019-09-03 19:37:01,652 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 19:37:01,653 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 19:37:01,653 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:37:01,653 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 19:37:01,653 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 19:37:01,653 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:37:01,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:37:01 BoogieIcfgContainer [2019-09-03 19:37:01,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:37:01,691 INFO L168 Benchmark]: Toolchain (without parser) took 144811.02 ms. Allocated memory was 131.1 MB in the beginning and 369.1 MB in the end (delta: 238.0 MB). Free memory was 87.3 MB in the beginning and 206.1 MB in the end (delta: -118.8 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:37:01,692 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:37:01,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.53 ms. Allocated memory is still 131.1 MB. Free memory was 87.1 MB in the beginning and 78.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-03 19:37:01,694 INFO L168 Benchmark]: Boogie Preprocessor took 115.78 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 78.0 MB in the beginning and 174.5 MB in the end (delta: -96.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:37:01,695 INFO L168 Benchmark]: RCFGBuilder took 220.76 ms. Allocated memory is still 198.2 MB. Free memory was 174.5 MB in the beginning and 163.0 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:37:01,699 INFO L168 Benchmark]: TraceAbstraction took 144178.25 ms. Allocated memory was 198.2 MB in the beginning and 369.1 MB in the end (delta: 170.9 MB). Free memory was 163.0 MB in the beginning and 206.1 MB in the end (delta: -43.2 MB). Peak memory consumption was 127.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:37:01,711 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.23 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.53 ms. Allocated memory is still 131.1 MB. Free memory was 87.1 MB in the beginning and 78.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.78 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 78.0 MB in the beginning and 174.5 MB in the end (delta: -96.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 220.76 ms. Allocated memory is still 198.2 MB. Free memory was 174.5 MB in the beginning and 163.0 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144178.25 ms. Allocated memory was 198.2 MB in the beginning and 369.1 MB in the end (delta: 170.9 MB). Free memory was 163.0 MB in the beginning and 206.1 MB in the end (delta: -43.2 MB). Peak memory consumption was 127.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 268435455 || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (x <= 0 && 0 <= x) || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 144.0s OverallTime, 14 OverallIterations, 80 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 223 SDtfs, 127 SDslu, 1152 SDs, 0 SdLazy, 3188 SolverSat, 247 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 630 SyntacticMatches, 10 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2635 ImplicationChecksByTransitivity, 25.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 63 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 22 PreInvPairs, 144 NumberOfFragments, 60 HoareAnnotationTreeSize, 22 FomulaSimplifications, 35831 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 170 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 110.7s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 1385 NumberOfCodeBlocks, 1246 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 1359 ConstructedInterpolants, 2 QuantifiedInterpolants, 424684 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1445 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 12466/26555 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...