java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:29:45,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:29:45,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:29:45,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:29:45,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:29:45,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:29:45,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:29:45,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:29:45,317 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:29:45,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:29:45,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:29:45,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:29:45,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:29:45,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:29:45,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:29:45,323 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:29:45,324 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:29:45,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:29:45,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:29:45,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:29:45,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:29:45,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:29:45,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:29:45,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:29:45,335 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:29:45,336 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:29:45,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:29:45,338 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:29:45,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:29:45,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:29:45,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:29:45,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:29:45,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:29:45,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:29:45,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:29:45,343 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:29:45,343 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:29:45,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:29:45,366 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:29:45,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:29:45,367 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:29:45,367 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:29:45,367 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:29:45,367 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:29:45,367 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:29:45,371 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:29:45,371 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:29:45,371 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:29:45,371 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:29:45,371 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:29:45,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:29:45,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:29:45,372 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:29:45,374 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:29:45,374 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:29:45,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:29:45,375 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:29:45,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:29:45,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:29:45,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:29:45,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:29:45,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:29:45,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:29:45,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:29:45,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:29:45,377 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:29:45,377 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:29:45,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:29:45,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:29:45,377 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:29:45,378 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:29:45,378 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:29:45,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:29:45,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:29:45,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:29:45,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:29:45,454 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:29:45,455 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i [2018-11-12 20:29:45,513 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ad5e5b9/1239d90257384ca0b29a1c88072b2f3b/FLAGbf33bc131 [2018-11-12 20:29:45,967 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:29:45,968 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i [2018-11-12 20:29:45,975 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ad5e5b9/1239d90257384ca0b29a1c88072b2f3b/FLAGbf33bc131 [2018-11-12 20:29:45,996 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ad5e5b9/1239d90257384ca0b29a1c88072b2f3b [2018-11-12 20:29:46,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:29:46,011 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:29:46,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:29:46,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:29:46,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:29:46,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:29:45" (1/1) ... [2018-11-12 20:29:46,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ceb4cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46, skipping insertion in model container [2018-11-12 20:29:46,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:29:45" (1/1) ... [2018-11-12 20:29:46,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:29:46,064 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:29:46,275 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:29:46,279 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:29:46,305 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:29:46,328 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:29:46,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46 WrapperNode [2018-11-12 20:29:46,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:29:46,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:29:46,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:29:46,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:29:46,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:29:46,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:29:46,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:29:46,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:29:46,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (1/1) ... [2018-11-12 20:29:46,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:29:46,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:29:46,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:29:46,395 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:29:46,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (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 [2018-11-12 20:29:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:29:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:29:46,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:29:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:29:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:29:46,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:29:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:29:46,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:29:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:29:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:29:46,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:29:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:29:47,064 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:29:47,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:29:47 BoogieIcfgContainer [2018-11-12 20:29:47,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:29:47,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:29:47,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:29:47,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:29:47,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:29:45" (1/3) ... [2018-11-12 20:29:47,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d3ddeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:29:47, skipping insertion in model container [2018-11-12 20:29:47,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:46" (2/3) ... [2018-11-12 20:29:47,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d3ddeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:29:47, skipping insertion in model container [2018-11-12 20:29:47,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:29:47" (3/3) ... [2018-11-12 20:29:47,085 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix_true-unreach-call_true-termination.i [2018-11-12 20:29:47,095 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:29:47,104 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:29:47,122 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:29:47,156 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:29:47,156 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:29:47,157 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:29:47,157 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:29:47,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:29:47,157 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:29:47,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:29:47,158 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:29:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-12 20:29:47,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-12 20:29:47,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:47,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:47,184 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:47,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1518561956, now seen corresponding path program 1 times [2018-11-12 20:29:47,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:47,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:47,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:47,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:47,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:47,292 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-12 20:29:47,292 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-12 20:29:47,292 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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 [2018-11-12 20:29:47,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:47,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-12 20:29:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:47,345 INFO L190 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-11-12 20:29:47,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:47,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:47,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:47,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:47,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:29:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:47,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:47,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:47,477 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:29:47,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-11-12 20:29:47,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:29:47,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:29:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:29:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:29:47,501 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-12 20:29:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:47,525 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-12 20:29:47,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:29:47,526 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-12 20:29:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:47,535 INFO L225 Difference]: With dead ends: 46 [2018-11-12 20:29:47,536 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:29:47,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:29:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:29:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-12 20:29:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-12 20:29:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-12 20:29:47,583 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2018-11-12 20:29:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:47,583 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-12 20:29:47,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:29:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-12 20:29:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:29:47,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:47,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:47,585 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:47,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash 876523911, now seen corresponding path program 1 times [2018-11-12 20:29:47,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:47,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:47,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:47,595 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-12 20:29:47,595 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-12 20:29:47,595 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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 [2018-11-12 20:29:47,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:47,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-12 20:29:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:47,660 INFO L190 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-11-12 20:29:47,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:47,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:47,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:47,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:47,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:29:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:47,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:47,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:29:47,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-11-12 20:29:47,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:29:47,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:29:47,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:29:47,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:29:47,865 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-12 20:29:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:47,928 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-12 20:29:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:29:47,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-12 20:29:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:47,931 INFO L225 Difference]: With dead ends: 32 [2018-11-12 20:29:47,931 INFO L226 Difference]: Without dead ends: 26 [2018-11-12 20:29:47,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:29:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-12 20:29:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-11-12 20:29:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-12 20:29:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-12 20:29:47,939 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-12 20:29:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:47,940 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-12 20:29:47,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:29:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-12 20:29:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:29:47,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:47,941 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:47,941 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:47,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash 69324171, now seen corresponding path program 1 times [2018-11-12 20:29:47,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:47,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:47,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:47,950 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-12 20:29:47,951 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-12 20:29:47,951 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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 [2018-11-12 20:29:47,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:47,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-12 20:29:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:48,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-11-12 20:29:48,022 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [34], [38], [42], [45], [47], [53], [54], [55], [57] [2018-11-12 20:29:48,062 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:29:48,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:29:48,271 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:29:48,277 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 20:29:48,280 INFO L272 AbstractInterpreter]: Visited 11 different actions 11 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 3. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 20 variables. [2018-11-12 20:29:48,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:48,322 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 20:29:48,443 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 65.27% of their original sizes. [2018-11-12 20:29:48,443 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 20:29:48,596 INFO L415 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-11-12 20:29:48,597 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 20:29:48,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:29:48,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:29:48,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:29:48,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:29:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:29:48,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:29:48,599 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-12 20:29:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:48,957 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-12 20:29:48,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:29:48,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-12 20:29:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:48,960 INFO L225 Difference]: With dead ends: 43 [2018-11-12 20:29:48,960 INFO L226 Difference]: Without dead ends: 30 [2018-11-12 20:29:48,961 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:29:48,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-12 20:29:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2018-11-12 20:29:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-12 20:29:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-12 20:29:48,969 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-11-12 20:29:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:48,970 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-12 20:29:48,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:29:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-12 20:29:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-12 20:29:48,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:48,971 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:48,972 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:48,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:48,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1276771180, now seen corresponding path program 1 times [2018-11-12 20:29:48,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:48,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:48,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:48,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:48,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:48,985 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-12 20:29:48,985 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-12 20:29:48,986 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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 [2018-11-12 20:29:48,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:48,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-12 20:29:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:49,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-12 20:29:49,048 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [23], [26], [30], [34], [38], [42], [45], [47], [53], [54], [55], [57] [2018-11-12 20:29:49,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:29:49,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:29:49,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:29:49,103 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:29:49,103 INFO L272 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 4 different actions 4 times. Never widened. Performed 123 root evaluator evaluations with a maximum evaluation depth of 3. Performed 123 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 20:29:49,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:49,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:29:49,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:49,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:49,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:49,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:29:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:49,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:49,363 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-12 20:29:49,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-12 20:29:49,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-12 20:29:49,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:49,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:49,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:49,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:10 [2018-11-12 20:29:49,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-12 20:29:49,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-12 20:29:49,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:49,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:49,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:49,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-12 20:29:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:49,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:49,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-12 20:29:49,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-12 20:29:49,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:49,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:49,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:29:49,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:19 [2018-11-12 20:29:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:50,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-12 20:29:50,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-11-12 20:29:50,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:50,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:29:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:29:50,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:29:50,211 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 13 states. [2018-11-12 20:29:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:50,965 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-12 20:29:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:29:50,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-12 20:29:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:50,967 INFO L225 Difference]: With dead ends: 67 [2018-11-12 20:29:50,967 INFO L226 Difference]: Without dead ends: 61 [2018-11-12 20:29:50,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:29:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-12 20:29:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2018-11-12 20:29:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-12 20:29:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-12 20:29:50,982 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 22 [2018-11-12 20:29:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:50,983 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-12 20:29:50,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:29:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-12 20:29:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-12 20:29:50,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:50,984 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:50,984 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:50,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:50,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1018605742, now seen corresponding path program 1 times [2018-11-12 20:29:50,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:50,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:50,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:50,992 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-12 20:29:50,992 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-12 20:29:50,993 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-12 20:29:51,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:51,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-12 20:29:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:51,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-12 20:29:51,047 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [21], [23], [28], [30], [34], [38], [42], [45], [47], [53], [54], [55], [57] [2018-11-12 20:29:51,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:29:51,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:29:51,063 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:29:51,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:29:51,086 INFO L272 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 4 different actions 4 times. Never widened. Performed 121 root evaluator evaluations with a maximum evaluation depth of 3. Performed 121 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 23 variables. [2018-11-12 20:29:51,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:51,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:29:51,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:51,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:51,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:51,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:29:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:51,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:51,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-12 20:29:51,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-12 20:29:51,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:51,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:51,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:51,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-12 20:29:51,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-12 20:29:51,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-12 20:29:51,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:51,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:51,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:51,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-12 20:29:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:51,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:51,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-12 20:29:51,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-12 20:29:51,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:51,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:51,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:29:51,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:19 [2018-11-12 20:29:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:51,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-12 20:29:51,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-12 20:29:51,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:51,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:29:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:29:51,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:29:51,630 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 16 states. [2018-11-12 20:29:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:52,638 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2018-11-12 20:29:52,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:29:52,639 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-12 20:29:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:52,640 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:29:52,640 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:29:52,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:29:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:29:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-11-12 20:29:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-12 20:29:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-12 20:29:52,652 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 22 [2018-11-12 20:29:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:52,653 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-12 20:29:52,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:29:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-12 20:29:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:29:52,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:52,655 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:52,655 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:52,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1315940048, now seen corresponding path program 2 times [2018-11-12 20:29:52,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:52,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:52,664 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-12 20:29:52,664 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-12 20:29:52,664 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-12 20:29:52,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:29:52,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-12 20:29:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:52,721 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:52,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:52,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:52,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:52,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:29:52,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:29:52,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:29:52,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:29:52,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:29:52,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:29:52,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-12 20:29:52,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-12 20:29:52,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:52,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:29:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:29:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:29:52,889 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 6 states. [2018-11-12 20:29:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:52,914 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-12 20:29:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:29:52,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-12 20:29:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:52,922 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:29:52,922 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:29:52,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:29:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:29:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:29:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:29:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:29:52,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-11-12 20:29:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:52,925 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:29:52,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:29:52,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:29:52,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:29:52,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:29:53,250 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:29:53,251 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:29:53,251 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:29:53,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:29:53,252 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:29:53,252 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:29:53,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:29:53,252 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2018-11-12 20:29:53,252 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 26) no Hoare annotation was computed. [2018-11-12 20:29:53,252 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 26) no Hoare annotation was computed. [2018-11-12 20:29:53,252 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 26) the Hoare annotation is: (or (and (= 1 main_~N_COL~0) (< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ main_~maior~0 1)) (= main_~j~0 1)) (and (not (= |main_~#matriz~0.base| 0)) (= |main_~#matriz~0.offset| 0) (<= 0 (+ main_~maior~0 2147483648)) (= main_~j~0 0) (= 1 main_~N_LIN~0) (= main_~N_COL~0 1) (<= main_~maior~0 2147483647))) [2018-11-12 20:29:53,253 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 26) no Hoare annotation was computed. [2018-11-12 20:29:53,253 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2018-11-12 20:29:53,253 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 31) the Hoare annotation is: true [2018-11-12 20:29:53,253 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= |main_#t~mem6| main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (or (forall ((|main_~#matriz~0.offset| Int)) (= (+ 0 (+ (* (* 4 (mod main_~N_LIN~0 4294967296)) (mod main_~j~0 4294967296)) |main_~#matriz~0.offset|)) |main_~#matriz~0.offset|)) (<= (mod main_~N_COL~0 4294967296) (mod main_~j~0 4294967296)))) [2018-11-12 20:29:53,253 INFO L425 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-11-12 20:29:53,253 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 25) no Hoare annotation was computed. [2018-11-12 20:29:53,253 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 26) no Hoare annotation was computed. [2018-11-12 20:29:53,253 INFO L425 ceAbstractionStarter]: For program point L20-3(lines 20 26) no Hoare annotation was computed. [2018-11-12 20:29:53,254 INFO L421 ceAbstractionStarter]: At program point L20-4(lines 20 26) the Hoare annotation is: (let ((.cse0 (= main_~j~0 0)) (.cse1 (= 1 main_~N_LIN~0))) (or (and (= 1 main_~N_COL~0) .cse0 (< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ main_~maior~0 1)) .cse1) (and (not (= |main_~#matriz~0.base| 0)) (= |main_~#matriz~0.offset| 0) (<= 0 (+ main_~maior~0 2147483648)) (= main_~k~0 0) .cse0 .cse1 (= main_~N_COL~0 1) (<= main_~maior~0 2147483647)))) [2018-11-12 20:29:53,254 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-12 20:29:53,254 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-12 20:29:53,254 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-12 20:29:53,254 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-12 20:29:53,255 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-12 20:29:53,255 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-12 20:29:53,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-12 20:29:53,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-12 20:29:53,265 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-12 20:29:53,266 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-12 20:29:53,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:29:53 BoogieIcfgContainer [2018-11-12 20:29:53,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:29:53,270 INFO L168 Benchmark]: Toolchain (without parser) took 7260.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -338.8 MB). Peak memory consumption was 427.7 MB. Max. memory is 7.1 GB. [2018-11-12 20:29:53,271 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:29:53,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:29:53,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:29:53,273 INFO L168 Benchmark]: Boogie Preprocessor took 32.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:29:53,274 INFO L168 Benchmark]: RCFGBuilder took 671.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:29:53,274 INFO L168 Benchmark]: TraceAbstraction took 6194.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 457.4 MB). Peak memory consumption was 457.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:29:53,278 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 671.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6194.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 457.4 MB). Peak memory consumption was 457.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2018-11-12 20:29:53,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-12 20:29:53,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((1 == N_COL && unknown-#memory_int-unknown[matriz][matriz] < maior + 1) && j == 1) || ((((((!(matriz == 0) && matriz == 0) && 0 <= maior + 2147483648) && j == 0) && 1 == N_LIN) && N_COL == 1) && maior <= 2147483647) - InvariantResult [Line: 20]: Loop Invariant [2018-11-12 20:29:53,288 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-12 20:29:53,289 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((1 == N_COL && j == 0) && unknown-#memory_int-unknown[matriz][matriz] < maior + 1) && 1 == N_LIN) || (((((((!(matriz == 0) && matriz == 0) && 0 <= maior + 2147483648) && k == 0) && j == 0) && 1 == N_LIN) && N_COL == 1) && maior <= 2147483647) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 96 SDslu, 304 SDs, 0 SdLazy, 353 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 245 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.8911764705882353 AbsIntWeakeningRatio, 0.8235294117647058 AbsIntAvgWeakeningVarsNumRemoved, 1.8823529411764706 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 19 NumberOfFragments, 130 HoareAnnotationTreeSize, 13 FomulaSimplifications, 7 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 145 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 226 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 198 ConstructedInterpolants, 8 QuantifiedInterpolants, 20851 SizeOfPredicates, 32 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 62/82 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...