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/nla-digbench/egcd.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:15:58,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:15:58,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:15:58,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:15:58,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:15:58,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:15:58,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:15:58,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:15:58,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:15:58,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:15:58,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:15:58,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:15:58,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:15:58,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:15:58,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:15:58,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:15:58,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:15:58,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:15:58,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:15:58,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:15:58,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:15:58,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:15:58,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:15:58,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:15:58,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:15:58,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:15:58,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:15:58,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:15:58,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:15:58,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:15:58,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:15:58,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:15:58,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:15:58,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:15:58,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:15:58,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:15:58,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:15:58,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:15:58,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:15:58,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:15:58,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:15:58,189 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 20:15:58,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:15:58,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:15:58,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:15:58,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:15:58,205 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:15:58,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:15:58,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:15:58,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:15:58,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:15:58,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:15:58,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:15:58,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:15:58,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:15:58,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:15:58,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:15:58,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:15:58,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:15:58,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:15:58,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:15:58,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:15:58,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:15:58,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:15:58,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:15:58,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:15:58,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:15:58,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:15:58,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:15:58,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:15:58,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:15:58,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:15:58,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:15:58,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:15:58,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:15:58,263 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:15:58,263 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd.c [2019-09-03 20:15:58,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828387140/722b04eeb1d64a798351fdb9493fc9f5/FLAG0e0291629 [2019-09-03 20:15:58,773 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:15:58,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd.c [2019-09-03 20:15:58,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828387140/722b04eeb1d64a798351fdb9493fc9f5/FLAG0e0291629 [2019-09-03 20:15:59,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828387140/722b04eeb1d64a798351fdb9493fc9f5 [2019-09-03 20:15:59,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:15:59,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:15:59,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:15:59,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:15:59,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:15:59,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a697fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59, skipping insertion in model container [2019-09-03 20:15:59,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,172 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:15:59,193 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:15:59,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:15:59,385 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:15:59,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:15:59,429 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:15:59,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59 WrapperNode [2019-09-03 20:15:59,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:15:59,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:15:59,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:15:59,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:15:59,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (1/1) ... [2019-09-03 20:15:59,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:15:59,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:15:59,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:15:59,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:15:59,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (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 20:15:59,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:15:59,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:15:59,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:15:59,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:15:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:15:59,821 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:15:59,822 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:15:59,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:15:59 BoogieIcfgContainer [2019-09-03 20:15:59,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:15:59,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:15:59,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:15:59,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:15:59,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:15:59" (1/3) ... [2019-09-03 20:15:59,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16df5d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:15:59, skipping insertion in model container [2019-09-03 20:15:59,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:59" (2/3) ... [2019-09-03 20:15:59,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16df5d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:15:59, skipping insertion in model container [2019-09-03 20:15:59,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:15:59" (3/3) ... [2019-09-03 20:15:59,840 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd.c [2019-09-03 20:15:59,864 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:15:59,884 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:15:59,907 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:15:59,933 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:15:59,934 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:15:59,934 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:15:59,934 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:15:59,934 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:15:59,935 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:15:59,935 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:15:59,935 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:15:59,935 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:15:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-03 20:15:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:15:59,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:59,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:59,958 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1589353370, now seen corresponding path program 1 times [2019-09-03 20:15:59,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:59,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:00,068 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 20:16:00,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:00,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:16:00,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:16:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:16:00,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:16:00,087 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-09-03 20:16:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:00,112 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2019-09-03 20:16:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:16:00,114 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:16:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:00,122 INFO L225 Difference]: With dead ends: 47 [2019-09-03 20:16:00,122 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 20:16:00,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:16:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 20:16:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 20:16:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:16:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-09-03 20:16:00,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 10 [2019-09-03 20:16:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:00,166 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-09-03 20:16:00,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:16:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-09-03 20:16:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:16:00,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:00,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:00,168 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1587685074, now seen corresponding path program 1 times [2019-09-03 20:16:00,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,179 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:00,180 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:00,180 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:00,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:16:00,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:00,312 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 20:16:00,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:00,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:00,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:00,320 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 5 states. [2019-09-03 20:16:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:00,438 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-09-03 20:16:00,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:00,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 20:16:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:00,440 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:16:00,440 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:16:00,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:16:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-03 20:16:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:16:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-09-03 20:16:00,458 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 10 [2019-09-03 20:16:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:00,459 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-09-03 20:16:00,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-09-03 20:16:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:16:00,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:00,460 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:00,461 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:00,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1592529048, now seen corresponding path program 1 times [2019-09-03 20:16:00,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:00,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:00,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:00,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,478 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:00,478 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:00,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:00,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:00,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:16:00,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:16:00,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:00,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:00,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:00,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:00,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:00,567 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2019-09-03 20:16:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:00,646 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-09-03 20:16:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:00,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 20:16:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:00,649 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:16:00,649 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 20:16:00,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 20:16:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-03 20:16:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:16:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2019-09-03 20:16:00,662 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 15 [2019-09-03 20:16:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:00,662 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-09-03 20:16:00,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2019-09-03 20:16:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:16:00,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:00,663 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:00,664 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2040988462, now seen corresponding path program 1 times [2019-09-03 20:16:00,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:00,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:00,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:00,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,673 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:00,673 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:00,673 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:00,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:00,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:16:00,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:16:00,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:00,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:00,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:00,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:00,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:00,782 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand 5 states. [2019-09-03 20:16:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:00,902 INFO L93 Difference]: Finished difference Result 63 states and 91 transitions. [2019-09-03 20:16:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:00,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-03 20:16:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:00,912 INFO L225 Difference]: With dead ends: 63 [2019-09-03 20:16:00,912 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:16:00,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:16:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-03 20:16:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:16:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2019-09-03 20:16:00,955 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 20 [2019-09-03 20:16:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:00,956 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2019-09-03 20:16:00,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2019-09-03 20:16:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:16:00,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:00,958 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:00,959 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:00,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash 113727669, now seen corresponding path program 1 times [2019-09-03 20:16:00,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:00,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:00,981 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:00,982 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:00,982 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:00,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:01,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:16:01,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:16:01,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:01,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:01,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:01,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:01,039 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand 5 states. [2019-09-03 20:16:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:01,116 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2019-09-03 20:16:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:01,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-03 20:16:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:01,118 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:16:01,118 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 20:16:01,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 20:16:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-03 20:16:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:16:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2019-09-03 20:16:01,136 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 26 [2019-09-03 20:16:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:01,136 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2019-09-03 20:16:01,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2019-09-03 20:16:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:16:01,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:01,140 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:01,140 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1597054094, now seen corresponding path program 1 times [2019-09-03 20:16:01,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:01,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:01,159 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:01,159 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:01,160 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:01,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:01,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:16:01,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Exception during sending of exit command (exit): Stream Closed [2019-09-03 20:16:01,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:01,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:16:01,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:16:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:16:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:16:01,254 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand 5 states. [2019-09-03 20:16:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:01,328 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-09-03 20:16:01,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:01,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-03 20:16:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:01,331 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:16:01,331 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:16:01,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:16:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-03 20:16:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 20:16:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2019-09-03 20:16:01,356 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 28 [2019-09-03 20:16:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:01,356 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2019-09-03 20:16:01,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2019-09-03 20:16:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:16:01,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:01,358 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:01,358 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1857063759, now seen corresponding path program 1 times [2019-09-03 20:16:01,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:01,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:01,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:01,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:01,378 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:01,378 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:01,378 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:01,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:01,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:16:01,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:16:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:16:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:16:01,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:16:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:16:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:01,481 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand 6 states. [2019-09-03 20:16:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:01,589 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-09-03 20:16:01,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:16:01,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-03 20:16:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:01,591 INFO L225 Difference]: With dead ends: 81 [2019-09-03 20:16:01,591 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 20:16:01,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 20:16:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-03 20:16:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 20:16:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-09-03 20:16:01,604 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 31 [2019-09-03 20:16:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:01,605 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-09-03 20:16:01,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:16:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-09-03 20:16:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:16:01,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:01,606 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:01,607 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:01,607 INFO L82 PathProgramCache]: Analyzing trace with hash -493170476, now seen corresponding path program 2 times [2019-09-03 20:16:01,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:01,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:01,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:01,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:01,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:01,615 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:01,618 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:01,618 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:16:01,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:16:01,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:01,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:16:01,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:16:01,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:01,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-03 20:16:01,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:16:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:16:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:01,738 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 6 states. [2019-09-03 20:16:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:01,877 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2019-09-03 20:16:01,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:16:01,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-09-03 20:16:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:01,880 INFO L225 Difference]: With dead ends: 108 [2019-09-03 20:16:01,880 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 20:16:01,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 20:16:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2019-09-03 20:16:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:16:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2019-09-03 20:16:01,896 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 33 [2019-09-03 20:16:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:01,896 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-09-03 20:16:01,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:16:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2019-09-03 20:16:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:16:01,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:01,898 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:01,898 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash -558447568, now seen corresponding path program 1 times [2019-09-03 20:16:01,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:01,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:01,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:01,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:01,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:01,904 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:01,905 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:01,905 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 (exit command is (exit), workingDir is null) [2019-09-03 20:16:01,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:01,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:16:01,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:16:02,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:02,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-03 20:16:02,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:16:02,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:16:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:16:02,029 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand 6 states. [2019-09-03 20:16:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:02,176 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-09-03 20:16:02,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:16:02,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-09-03 20:16:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:02,179 INFO L225 Difference]: With dead ends: 125 [2019-09-03 20:16:02,179 INFO L226 Difference]: Without dead ends: 119 [2019-09-03 20:16:02,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-03 20:16:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-09-03 20:16:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:16:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2019-09-03 20:16:02,204 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 38 [2019-09-03 20:16:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:02,204 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2019-09-03 20:16:02,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:16:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2019-09-03 20:16:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:16:02,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:02,216 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:02,217 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:02,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:02,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1383929332, now seen corresponding path program 1 times [2019-09-03 20:16:02,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:02,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:02,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:02,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:02,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:02,234 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:02,234 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:02,234 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:02,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:02,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:16:02,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:16:02,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:02,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:16:02,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:16:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:16:02,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:02,344 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand 7 states. [2019-09-03 20:16:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:02,507 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2019-09-03 20:16:02,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:16:02,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-09-03 20:16:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:02,514 INFO L225 Difference]: With dead ends: 141 [2019-09-03 20:16:02,514 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 20:16:02,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 20:16:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-03 20:16:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:16:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-09-03 20:16:02,540 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 46 [2019-09-03 20:16:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:02,540 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-09-03 20:16:02,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:16:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-09-03 20:16:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:16:02,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:02,549 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:02,549 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1192657524, now seen corresponding path program 2 times [2019-09-03 20:16:02,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:02,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:02,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:02,561 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:02,561 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:02,562 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 (exit command is (exit), workingDir is null) [2019-09-03 20:16:02,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:02,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:16:02,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:02,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:16:02,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:16:02,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:02,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:16:02,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:16:02,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:16:02,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:02,689 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 7 states. [2019-09-03 20:16:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:02,832 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2019-09-03 20:16:02,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:16:02,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-09-03 20:16:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:02,835 INFO L225 Difference]: With dead ends: 154 [2019-09-03 20:16:02,835 INFO L226 Difference]: Without dead ends: 151 [2019-09-03 20:16:02,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-03 20:16:02,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-09-03 20:16:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 20:16:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 189 transitions. [2019-09-03 20:16:02,852 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 189 transitions. Word has length 46 [2019-09-03 20:16:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:02,853 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 189 transitions. [2019-09-03 20:16:02,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:16:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 189 transitions. [2019-09-03 20:16:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 20:16:02,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:02,854 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:02,855 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1196309741, now seen corresponding path program 1 times [2019-09-03 20:16:02,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:02,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:02,861 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:02,861 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:02,861 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 (exit command is (exit), workingDir is null) [2019-09-03 20:16:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:16:02,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:16:02,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:02,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:16:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-03 20:16:02,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:02,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:16:02,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:16:02,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:16:02,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:16:02,997 INFO L87 Difference]: Start difference. First operand 148 states and 189 transitions. Second operand 9 states. [2019-09-03 20:16:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:03,156 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2019-09-03 20:16:03,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:16:03,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-09-03 20:16:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:03,161 INFO L225 Difference]: With dead ends: 161 [2019-09-03 20:16:03,161 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 20:16:03,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:16:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 20:16:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-09-03 20:16:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-03 20:16:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 194 transitions. [2019-09-03 20:16:03,180 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 194 transitions. Word has length 49 [2019-09-03 20:16:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:03,180 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 194 transitions. [2019-09-03 20:16:03,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:16:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 194 transitions. [2019-09-03 20:16:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 20:16:03,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:03,182 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:03,182 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 336099856, now seen corresponding path program 3 times [2019-09-03 20:16:03,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:03,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:03,189 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:03,189 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:03,189 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:03,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:16:03,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:16:03,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:03,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:16:03,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:16:03,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:03,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:16:03,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:16:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:16:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:03,329 INFO L87 Difference]: Start difference. First operand 157 states and 194 transitions. Second operand 7 states. [2019-09-03 20:16:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:03,505 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-09-03 20:16:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:16:03,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-03 20:16:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:03,508 INFO L225 Difference]: With dead ends: 187 [2019-09-03 20:16:03,508 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 20:16:03,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 20:16:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2019-09-03 20:16:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 20:16:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 224 transitions. [2019-09-03 20:16:03,525 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 224 transitions. Word has length 51 [2019-09-03 20:16:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:03,526 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 224 transitions. [2019-09-03 20:16:03,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:16:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 224 transitions. [2019-09-03 20:16:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 20:16:03,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:03,527 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:03,527 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1722303250, now seen corresponding path program 3 times [2019-09-03 20:16:03,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:03,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:03,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:03,533 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:03,533 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:03,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:03,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:16:03,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:16:03,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:03,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:16:03,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:16:03,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:03,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:16:03,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:16:03,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:16:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:16:03,691 INFO L87 Difference]: Start difference. First operand 181 states and 224 transitions. Second operand 7 states. [2019-09-03 20:16:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:03,864 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2019-09-03 20:16:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:16:03,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-03 20:16:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:03,867 INFO L225 Difference]: With dead ends: 210 [2019-09-03 20:16:03,867 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 20:16:03,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:16:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 20:16:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2019-09-03 20:16:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 20:16:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2019-09-03 20:16:03,885 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 51 [2019-09-03 20:16:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:03,885 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2019-09-03 20:16:03,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:16:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2019-09-03 20:16:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:16:03,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:03,886 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:03,886 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:03,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1389199476, now seen corresponding path program 4 times [2019-09-03 20:16:03,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:03,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:03,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:03,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:03,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:03,892 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:03,892 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:03,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:16:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:03,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:16:03,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:03,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:16:03,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:06,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:16:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-03 20:16:06,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:06,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-03 20:16:06,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:16:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:16:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2019-09-03 20:16:06,194 INFO L87 Difference]: Start difference. First operand 194 states and 235 transitions. Second operand 11 states. [2019-09-03 20:16:08,298 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-03 20:16:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:08,634 INFO L93 Difference]: Finished difference Result 198 states and 238 transitions. [2019-09-03 20:16:08,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:16:08,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-09-03 20:16:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:08,635 INFO L225 Difference]: With dead ends: 198 [2019-09-03 20:16:08,635 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:16:08,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2019-09-03 20:16:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:16:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:16:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:16:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:16:08,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-09-03 20:16:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:08,642 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:16:08,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:16:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:16:08,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:16:08,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 20:16:18,341 WARN L188 SmtUtils]: Spent 9.42 s on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-03 20:16:23,273 WARN L188 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-03 20:16:35,912 WARN L188 SmtUtils]: Spent 12.64 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-03 20:16:45,390 WARN L188 SmtUtils]: Spent 9.47 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-03 20:16:47,474 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-03 20:16:47,476 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 20:16:47,476 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:16:47,476 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:16:47,476 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 20:16:47,476 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 20:16:47,476 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 20:16:47,476 INFO L443 ceAbstractionStarter]: For program point L31(lines 28 45) no Hoare annotation was computed. [2019-09-03 20:16:47,477 INFO L439 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-03 20:16:47,477 INFO L439 ceAbstractionStarter]: At program point L29-1(line 29) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-03 20:16:47,477 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 52) no Hoare annotation was computed. [2019-09-03 20:16:47,477 INFO L443 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-09-03 20:16:47,477 INFO L439 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (let ((.cse1 (= main_~p~0 1)) (.cse2 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse0 (= main_~s~0 1)) (.cse3 (= main_~b~0 main_~a~0)) (.cse4 (<= 1 main_~x~0)) (.cse6 (+ main_~p~0 main_~q~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= main_~r~0 0) .cse0 .cse1 .cse2 .cse4 .cse5 (= main_~a~0 main_~x~0)) (and .cse0 (= 1 .cse6) .cse3 (= (+ main_~q~0 1) 0) .cse4 (= main_~y~0 (+ main_~x~0 main_~b~0)) (= (+ main_~r~0 (* 2 main_~s~0)) 1)) (let ((.cse10 (+ main_~r~0 main_~s~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse9 (+ (* 2 main_~p~0) main_~q~0)) (.cse8 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse7 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse7 (- 1))) (+ (* main_~y~0 .cse8) (* main_~x~0 .cse9))) .cse7)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse9) (- (* .cse8 (+ main_~p~0 main_~q~0)))))))) .cse4 (= main_~a~0 (+ (+ (* main_~y~0 .cse10) (* main_~x~0 .cse6)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse10)) (* main_~s~0 .cse6))))))) [2019-09-03 20:16:47,477 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 52) no Hoare annotation was computed. [2019-09-03 20:16:47,478 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 44) no Hoare annotation was computed. [2019-09-03 20:16:47,478 INFO L439 ceAbstractionStarter]: At program point L36-2(lines 28 45) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-03 20:16:47,478 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-03 20:16:47,478 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 52) the Hoare annotation is: true [2019-09-03 20:16:47,478 INFO L439 ceAbstractionStarter]: At program point L28-2(lines 28 45) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (<= 1 main_~x~0) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-03 20:16:47,479 INFO L439 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= main_~s~0 1)) (.cse1 (<= 1 main_~x~0))) (or (and .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~q~0 0)) (and .cse0 (= main_~b~0 main_~a~0) (= (+ main_~q~0 1) 0) .cse1 (= main_~y~0 (+ main_~x~0 main_~b~0))) (let ((.cse5 (+ main_~r~0 main_~s~0)) (.cse6 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse4 (+ (* 2 main_~p~0) main_~q~0)) (.cse3 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse2 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse2 (- 1))) (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4))) .cse2)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse4) (- (* .cse3 (+ main_~p~0 main_~q~0)))))))) .cse1 (= main_~a~0 (+ (+ (* main_~y~0 .cse5) (* main_~x~0 .cse6)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse5)) (* main_~s~0 .cse6))))))) [2019-09-03 20:16:47,479 INFO L439 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (<= 1 main_~x~0) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-03 20:16:47,479 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 11) the Hoare annotation is: true [2019-09-03 20:16:47,479 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-09-03 20:16:47,480 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 11) no Hoare annotation was computed. [2019-09-03 20:16:47,480 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2019-09-03 20:16:47,480 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 9) no Hoare annotation was computed. [2019-09-03 20:16:47,480 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 11) no Hoare annotation was computed. [2019-09-03 20:16:47,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:16:47 BoogieIcfgContainer [2019-09-03 20:16:47,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:16:47,505 INFO L168 Benchmark]: Toolchain (without parser) took 48351.13 ms. Allocated memory was 139.5 MB in the beginning and 304.6 MB in the end (delta: 165.2 MB). Free memory was 87.6 MB in the beginning and 175.7 MB in the end (delta: -88.1 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:16:47,505 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:16:47,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.33 ms. Allocated memory is still 139.5 MB. Free memory was 87.3 MB in the beginning and 77.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:16:47,507 INFO L168 Benchmark]: Boogie Preprocessor took 114.59 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 77.7 MB in the beginning and 177.7 MB in the end (delta: -100.0 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:16:47,508 INFO L168 Benchmark]: RCFGBuilder took 278.62 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 164.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:16:47,509 INFO L168 Benchmark]: TraceAbstraction took 47678.10 ms. Allocated memory was 199.8 MB in the beginning and 304.6 MB in the end (delta: 104.9 MB). Free memory was 164.6 MB in the beginning and 175.7 MB in the end (delta: -11.1 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:16:47,512 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 139.5 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.33 ms. Allocated memory is still 139.5 MB. Free memory was 87.3 MB in the beginning and 77.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.59 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 77.7 MB in the beginning and 177.7 MB in the end (delta: -100.0 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 278.62 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 164.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47678.10 ms. Allocated memory was 199.8 MB in the beginning and 304.6 MB in the end (delta: 104.9 MB). Free memory was 164.6 MB in the beginning and 175.7 MB in the end (delta: -11.1 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 28]: Loop Invariant [2019-09-03 20:16:47,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-03 20:16:47,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-03 20:16:47,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] Derived loop invariant: (((\exists main_~p~0 : int, main_~r~0 : int :: -1 * b + (main_~p~0 * x + y * main_~r~0) * -1 + (y * (2 * main_~r~0 + s) + x * (2 * main_~p~0 + q)) == main_~p~0 * x + y * main_~r~0 && 1 == (main_~r~0 + s) * (2 * main_~p~0 + q) + -((2 * main_~r~0 + s) * (main_~p~0 + q))) && a == y * (r + s) + x * (p + q) + -1 * b) && 1 <= x) && 1 == -(q * (r + s)) + s * (p + q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 47.5s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 38.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 119 SDslu, 1484 SDs, 0 SdLazy, 948 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 508 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=14, 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 36 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 82 PreInvPairs, 158 NumberOfFragments, 917 HoareAnnotationTreeSize, 82 FomulaSimplifications, 9106 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 461 FormulaSimplificationTreeSizeReductionInter, 38.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 510 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 495 ConstructedInterpolants, 4 QuantifiedInterpolants, 126896 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 692/798 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...