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/eca-rers2012/Problem16_label04_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 16:40:25,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 16:40:25,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 16:40:25,323 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 16:40:25,323 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 16:40:25,324 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 16:40:25,326 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 16:40:25,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 16:40:25,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 16:40:25,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 16:40:25,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 16:40:25,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 16:40:25,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 16:40:25,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 16:40:25,334 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 16:40:25,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 16:40:25,336 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 16:40:25,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 16:40:25,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 16:40:25,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 16:40:25,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 16:40:25,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 16:40:25,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 16:40:25,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 16:40:25,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 16:40:25,354 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 16:40:25,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 16:40:25,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 16:40:25,358 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 16:40:25,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 16:40:25,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 16:40:25,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 16:40:25,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 16:40:25,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 16:40:25,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 16:40:25,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 16:40:25,367 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 16:40:25,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 16:40:25,395 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 16:40:25,396 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 16:40:25,396 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 16:40:25,396 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 16:40:25,396 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 16:40:25,396 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 16:40:25,397 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 16:40:25,397 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 16:40:25,397 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 16:40:25,397 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 16:40:25,397 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 16:40:25,397 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 16:40:25,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 16:40:25,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 16:40:25,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 16:40:25,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 16:40:25,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 16:40:25,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 16:40:25,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 16:40:25,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 16:40:25,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 16:40:25,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 16:40:25,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 16:40:25,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 16:40:25,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:40:25,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 16:40:25,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 16:40:25,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 16:40:25,403 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 16:40:25,403 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 16:40:25,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 16:40:25,404 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 16:40:25,404 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 16:40:25,404 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 16:40:25,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 16:40:25,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 16:40:25,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 16:40:25,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 16:40:25,481 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 16:40:25,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label04_false-unreach-call.c [2018-11-12 16:40:25,550 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26409d80c/3e149cfe753a44339dd70cdf0bc8e706/FLAGfd08e154a [2018-11-12 16:40:26,282 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 16:40:26,283 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label04_false-unreach-call.c [2018-11-12 16:40:26,301 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26409d80c/3e149cfe753a44339dd70cdf0bc8e706/FLAGfd08e154a [2018-11-12 16:40:26,317 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26409d80c/3e149cfe753a44339dd70cdf0bc8e706 [2018-11-12 16:40:26,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 16:40:26,331 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 16:40:26,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 16:40:26,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 16:40:26,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 16:40:26,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:26" (1/1) ... [2018-11-12 16:40:26,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425d5bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:26, skipping insertion in model container [2018-11-12 16:40:26,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:26" (1/1) ... [2018-11-12 16:40:26,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 16:40:26,439 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 16:40:27,407 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:40:27,413 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 16:40:27,722 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:40:27,743 INFO L193 MainTranslator]: Completed translation [2018-11-12 16:40:27,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27 WrapperNode [2018-11-12 16:40:27,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 16:40:27,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 16:40:27,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 16:40:27,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 16:40:27,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:27,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:27,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 16:40:27,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 16:40:27,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 16:40:27,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 16:40:27,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:27,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:27,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:27,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:28,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:28,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:28,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (1/1) ... [2018-11-12 16:40:28,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 16:40:28,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 16:40:28,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 16:40:28,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 16:40:28,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (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 16:40:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 16:40:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 16:40:28,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 16:40:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-12 16:40:28,166 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-12 16:40:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 16:40:28,166 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 16:40:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 16:40:28,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 16:40:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 16:40:28,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 16:40:34,774 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 16:40:34,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:34 BoogieIcfgContainer [2018-11-12 16:40:34,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 16:40:34,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 16:40:34,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 16:40:34,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 16:40:34,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:40:26" (1/3) ... [2018-11-12 16:40:34,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2ee1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:34, skipping insertion in model container [2018-11-12 16:40:34,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:27" (2/3) ... [2018-11-12 16:40:34,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2ee1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:34, skipping insertion in model container [2018-11-12 16:40:34,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:34" (3/3) ... [2018-11-12 16:40:34,784 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label04_false-unreach-call.c [2018-11-12 16:40:34,794 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 16:40:34,804 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 16:40:34,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 16:40:34,865 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 16:40:34,865 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 16:40:34,865 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 16:40:34,866 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 16:40:34,866 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 16:40:34,866 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 16:40:34,866 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 16:40:34,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 16:40:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-11-12 16:40:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 16:40:34,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:40:34,915 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:40:34,918 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:40:34,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:40:34,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1727147373, now seen corresponding path program 1 times [2018-11-12 16:40:34,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:40:34,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:34,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:40:34,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:34,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:40:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:40:35,386 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:40:35,415 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 16:40:35,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:40:35,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:40:35,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:40:35,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:40:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:40:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:40:35,446 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-11-12 16:40:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:40:38,690 INFO L93 Difference]: Finished difference Result 1156 states and 2144 transitions. [2018-11-12 16:40:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:40:38,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-12 16:40:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:40:38,718 INFO L225 Difference]: With dead ends: 1156 [2018-11-12 16:40:38,718 INFO L226 Difference]: Without dead ends: 744 [2018-11-12 16:40:38,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:40:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-11-12 16:40:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-11-12 16:40:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-12 16:40:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1317 transitions. [2018-11-12 16:40:38,862 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1317 transitions. Word has length 35 [2018-11-12 16:40:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:40:38,863 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1317 transitions. [2018-11-12 16:40:38,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:40:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1317 transitions. [2018-11-12 16:40:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-12 16:40:38,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:40:38,871 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:40:38,871 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:40:38,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:40:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1128673264, now seen corresponding path program 1 times [2018-11-12 16:40:38,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:40:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:38,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:40:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:38,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:40:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:40:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:40:39,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:40:39,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:40:39,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:40:39,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:40:39,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:40:39,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:40:39,356 INFO L87 Difference]: Start difference. First operand 744 states and 1317 transitions. Second operand 6 states. [2018-11-12 16:40:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:40:48,948 INFO L93 Difference]: Finished difference Result 2960 states and 5498 transitions. [2018-11-12 16:40:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 16:40:48,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-11-12 16:40:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:40:48,975 INFO L225 Difference]: With dead ends: 2960 [2018-11-12 16:40:48,975 INFO L226 Difference]: Without dead ends: 2222 [2018-11-12 16:40:48,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-12 16:40:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2018-11-12 16:40:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2174. [2018-11-12 16:40:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2018-11-12 16:40:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3682 transitions. [2018-11-12 16:40:49,129 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3682 transitions. Word has length 111 [2018-11-12 16:40:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:40:49,130 INFO L480 AbstractCegarLoop]: Abstraction has 2174 states and 3682 transitions. [2018-11-12 16:40:49,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:40:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3682 transitions. [2018-11-12 16:40:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-12 16:40:49,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:40:49,141 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:40:49,142 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:40:49,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:40:49,142 INFO L82 PathProgramCache]: Analyzing trace with hash -950142376, now seen corresponding path program 1 times [2018-11-12 16:40:49,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:40:49,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:49,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:40:49,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:49,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:40:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:40:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:40:49,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:40:49,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:40:49,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:40:49,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:40:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:40:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:40:49,430 INFO L87 Difference]: Start difference. First operand 2174 states and 3682 transitions. Second operand 6 states. [2018-11-12 16:40:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:40:54,526 INFO L93 Difference]: Finished difference Result 8043 states and 14310 transitions. [2018-11-12 16:40:54,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:40:54,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-11-12 16:40:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:40:54,574 INFO L225 Difference]: With dead ends: 8043 [2018-11-12 16:40:54,575 INFO L226 Difference]: Without dead ends: 5875 [2018-11-12 16:40:54,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:40:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5875 states. [2018-11-12 16:40:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5875 to 5820. [2018-11-12 16:40:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5820 states. [2018-11-12 16:40:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5820 states to 5820 states and 8971 transitions. [2018-11-12 16:40:54,785 INFO L78 Accepts]: Start accepts. Automaton has 5820 states and 8971 transitions. Word has length 115 [2018-11-12 16:40:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:40:54,785 INFO L480 AbstractCegarLoop]: Abstraction has 5820 states and 8971 transitions. [2018-11-12 16:40:54,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:40:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5820 states and 8971 transitions. [2018-11-12 16:40:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-12 16:40:54,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:40:54,792 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:40:54,792 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:40:54,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:40:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash -905675908, now seen corresponding path program 1 times [2018-11-12 16:40:54,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:40:54,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:54,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:40:54,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:54,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:40:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:40:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:40:55,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:40:55,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:40:55,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:40:55,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:40:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:40:55,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:40:55,033 INFO L87 Difference]: Start difference. First operand 5820 states and 8971 transitions. Second operand 6 states. [2018-11-12 16:40:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:40:58,897 INFO L93 Difference]: Finished difference Result 13797 states and 22451 transitions. [2018-11-12 16:40:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:40:58,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-11-12 16:40:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:40:58,955 INFO L225 Difference]: With dead ends: 13797 [2018-11-12 16:40:58,956 INFO L226 Difference]: Without dead ends: 7983 [2018-11-12 16:40:58,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:40:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7983 states. [2018-11-12 16:40:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7983 to 7902. [2018-11-12 16:40:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7902 states. [2018-11-12 16:40:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7902 states to 7902 states and 11582 transitions. [2018-11-12 16:40:59,205 INFO L78 Accepts]: Start accepts. Automaton has 7902 states and 11582 transitions. Word has length 117 [2018-11-12 16:40:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:40:59,206 INFO L480 AbstractCegarLoop]: Abstraction has 7902 states and 11582 transitions. [2018-11-12 16:40:59,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:40:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 7902 states and 11582 transitions. [2018-11-12 16:40:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-12 16:40:59,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:40:59,210 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:40:59,210 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:40:59,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:40:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1836053929, now seen corresponding path program 1 times [2018-11-12 16:40:59,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:40:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:59,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:40:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:40:59,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:40:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:40:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:40:59,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:40:59,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:40:59,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:40:59,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:40:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:40:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:40:59,440 INFO L87 Difference]: Start difference. First operand 7902 states and 11582 transitions. Second operand 6 states. [2018-11-12 16:41:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:41:02,478 INFO L93 Difference]: Finished difference Result 19254 states and 30272 transitions. [2018-11-12 16:41:02,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:41:02,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-11-12 16:41:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:41:02,544 INFO L225 Difference]: With dead ends: 19254 [2018-11-12 16:41:02,545 INFO L226 Difference]: Without dead ends: 11358 [2018-11-12 16:41:02,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:41:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11358 states. [2018-11-12 16:41:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11358 to 11325. [2018-11-12 16:41:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11325 states. [2018-11-12 16:41:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11325 states to 11325 states and 16212 transitions. [2018-11-12 16:41:02,885 INFO L78 Accepts]: Start accepts. Automaton has 11325 states and 16212 transitions. Word has length 120 [2018-11-12 16:41:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:41:02,886 INFO L480 AbstractCegarLoop]: Abstraction has 11325 states and 16212 transitions. [2018-11-12 16:41:02,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:41:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11325 states and 16212 transitions. [2018-11-12 16:41:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-12 16:41:02,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:41:02,890 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:41:02,891 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:41:02,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:41:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash 116215820, now seen corresponding path program 1 times [2018-11-12 16:41:02,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:41:02,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:41:02,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:41:02,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:41:02,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:41:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:41:03,159 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:41:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:41:03,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:41:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:41:03,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:41:03,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:41:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:41:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:41:03,556 INFO L87 Difference]: Start difference. First operand 11325 states and 16212 transitions. Second operand 6 states. [2018-11-12 16:41:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:41:07,139 INFO L93 Difference]: Finished difference Result 24429 states and 35685 transitions. [2018-11-12 16:41:07,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:41:07,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-11-12 16:41:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:41:07,194 INFO L225 Difference]: With dead ends: 24429 [2018-11-12 16:41:07,195 INFO L226 Difference]: Without dead ends: 13110 [2018-11-12 16:41:07,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:41:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13110 states. [2018-11-12 16:41:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13110 to 13084. [2018-11-12 16:41:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13084 states. [2018-11-12 16:41:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13084 states to 13084 states and 17325 transitions. [2018-11-12 16:41:07,503 INFO L78 Accepts]: Start accepts. Automaton has 13084 states and 17325 transitions. Word has length 125 [2018-11-12 16:41:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:41:07,503 INFO L480 AbstractCegarLoop]: Abstraction has 13084 states and 17325 transitions. [2018-11-12 16:41:07,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:41:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13084 states and 17325 transitions. [2018-11-12 16:41:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-12 16:41:07,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:41:07,506 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:41:07,506 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:41:07,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:41:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1715390160, now seen corresponding path program 1 times [2018-11-12 16:41:07,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:41:07,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:41:07,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:41:07,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:41:07,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:41:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:41:07,744 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:41:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 16:41:07,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:41:07,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:41:07,978 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-11-12 16:41:07,981 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [359], [361], [364], [372], [380], [388], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-12 16:41:08,037 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:41:08,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:41:08,715 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:41:09,205 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:41:09,208 INFO L272 AbstractInterpreter]: Visited 99 different actions 284 times. Merged at 5 different actions 9 times. Never widened. Performed 4374 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4374 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 16:41:09,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:41:09,252 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:41:09,753 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 81.82% of their original sizes. [2018-11-12 16:41:09,753 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:41:10,646 INFO L415 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2018-11-12 16:41:10,647 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:41:10,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:41:10,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [4] total 18 [2018-11-12 16:41:10,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:41:10,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 16:41:10,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 16:41:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-12 16:41:10,649 INFO L87 Difference]: Start difference. First operand 13084 states and 17325 transitions. Second operand 16 states. [2018-11-12 16:41:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:41:46,800 INFO L93 Difference]: Finished difference Result 28600 states and 37714 transitions. [2018-11-12 16:41:46,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 16:41:46,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 127 [2018-11-12 16:41:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:41:46,881 INFO L225 Difference]: With dead ends: 28600 [2018-11-12 16:41:46,881 INFO L226 Difference]: Without dead ends: 15522 [2018-11-12 16:41:46,967 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-11-12 16:41:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15522 states. [2018-11-12 16:41:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15522 to 15518. [2018-11-12 16:41:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15518 states. [2018-11-12 16:41:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15518 states to 15518 states and 19904 transitions. [2018-11-12 16:41:47,411 INFO L78 Accepts]: Start accepts. Automaton has 15518 states and 19904 transitions. Word has length 127 [2018-11-12 16:41:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:41:47,411 INFO L480 AbstractCegarLoop]: Abstraction has 15518 states and 19904 transitions. [2018-11-12 16:41:47,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 16:41:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 15518 states and 19904 transitions. [2018-11-12 16:41:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-12 16:41:47,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:41:47,416 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:41:47,416 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:41:47,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:41:47,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1988643400, now seen corresponding path program 1 times [2018-11-12 16:41:47,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:41:47,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:41:47,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:41:47,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:41:47,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:41:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:41:47,680 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:41:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 16:41:47,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:41:47,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:41:47,917 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-12 16:41:47,918 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [359], [361], [364], [372], [380], [388], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [904], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-12 16:41:47,931 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:41:47,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:41:48,139 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:41:48,533 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:41:48,533 INFO L272 AbstractInterpreter]: Visited 135 different actions 392 times. Merged at 5 different actions 9 times. Never widened. Performed 7033 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7033 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 16:41:48,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:41:48,576 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:41:48,959 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 81.82% of their original sizes. [2018-11-12 16:41:48,959 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:41:50,037 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-12 16:41:50,037 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:41:50,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:41:50,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 19 [2018-11-12 16:41:50,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:41:50,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 16:41:50,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 16:41:50,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-11-12 16:41:50,039 INFO L87 Difference]: Start difference. First operand 15518 states and 19904 transitions. Second operand 17 states. [2018-11-12 16:42:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:42:29,639 INFO L93 Difference]: Finished difference Result 31725 states and 41135 transitions. [2018-11-12 16:42:29,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 16:42:29,639 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 163 [2018-11-12 16:42:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:42:29,722 INFO L225 Difference]: With dead ends: 31725 [2018-11-12 16:42:29,723 INFO L226 Difference]: Without dead ends: 17615 [2018-11-12 16:42:29,761 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 173 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2018-11-12 16:42:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17615 states. [2018-11-12 16:42:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17615 to 17138. [2018-11-12 16:42:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17138 states. [2018-11-12 16:42:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 21792 transitions. [2018-11-12 16:42:30,106 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 21792 transitions. Word has length 163 [2018-11-12 16:42:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:42:30,106 INFO L480 AbstractCegarLoop]: Abstraction has 17138 states and 21792 transitions. [2018-11-12 16:42:30,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 16:42:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 21792 transitions. [2018-11-12 16:42:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-11-12 16:42:30,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:42:30,120 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:42:30,120 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:42:30,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:42:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1295963400, now seen corresponding path program 1 times [2018-11-12 16:42:30,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:42:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:42:30,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:42:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:42:30,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:42:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:42:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:42:30,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:42:30,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:42:30,762 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-11-12 16:42:30,763 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [359], [361], [364], [372], [380], [388], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [772], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-12 16:42:30,769 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:42:30,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:42:31,407 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:42:31,407 INFO L272 AbstractInterpreter]: Visited 248 different actions 492 times. Merged at 5 different actions 7 times. Never widened. Performed 8220 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 16:42:31,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:42:31,431 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:42:31,914 INFO L227 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 78.18% of their original sizes. [2018-11-12 16:42:31,915 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:42:32,506 INFO L415 sIntCurrentIteration]: We unified 369 AI predicates to 369 [2018-11-12 16:42:32,507 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:42:32,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:42:32,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 16:42:32,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:42:32,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 16:42:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 16:42:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-11-12 16:42:32,509 INFO L87 Difference]: Start difference. First operand 17138 states and 21792 transitions. Second operand 18 states. [2018-11-12 16:42:34,289 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:42:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:42:52,803 INFO L93 Difference]: Finished difference Result 32953 states and 42331 transitions. [2018-11-12 16:42:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 16:42:52,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 370 [2018-11-12 16:42:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:42:52,870 INFO L225 Difference]: With dead ends: 32953 [2018-11-12 16:42:52,870 INFO L226 Difference]: Without dead ends: 17774 [2018-11-12 16:42:52,912 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 385 GetRequests, 330 SyntacticMatches, 23 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 16:42:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17774 states. [2018-11-12 16:42:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17774 to 17769. [2018-11-12 16:42:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17769 states. [2018-11-12 16:42:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 22461 transitions. [2018-11-12 16:42:53,280 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 22461 transitions. Word has length 370 [2018-11-12 16:42:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:42:53,281 INFO L480 AbstractCegarLoop]: Abstraction has 17769 states and 22461 transitions. [2018-11-12 16:42:53,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 16:42:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 22461 transitions. [2018-11-12 16:42:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-11-12 16:42:53,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:42:53,298 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:42:53,299 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:42:53,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:42:53,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1799527320, now seen corresponding path program 1 times [2018-11-12 16:42:53,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:42:53,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:42:53,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:42:53,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:42:53,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:42:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:42:53,681 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:42:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 57 proven. 86 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 16:42:54,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:42:54,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:42:54,286 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 379 with the following transitions: [2018-11-12 16:42:54,287 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [359], [361], [364], [372], [380], [388], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [772], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-12 16:42:54,293 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:42:54,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:43:00,747 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:43:00,747 INFO L272 AbstractInterpreter]: Visited 256 different actions 2006 times. Merged at 5 different actions 35 times. Widened at 1 different actions 3 times. Performed 35631 root evaluator evaluations with a maximum evaluation depth of 6. Performed 35631 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 16:43:00,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:43:00,754 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:43:01,220 INFO L227 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 77.84% of their original sizes. [2018-11-12 16:43:01,221 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:43:01,562 INFO L415 sIntCurrentIteration]: We unified 377 AI predicates to 377 [2018-11-12 16:43:01,562 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:43:01,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:43:01,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-12 16:43:01,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:43:01,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 16:43:01,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 16:43:01,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-12 16:43:01,564 INFO L87 Difference]: Start difference. First operand 17769 states and 22461 transitions. Second operand 20 states. [2018-11-12 16:43:04,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:43:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:43:32,555 INFO L93 Difference]: Finished difference Result 33589 states and 43100 transitions. [2018-11-12 16:43:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 16:43:32,555 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 378 [2018-11-12 16:43:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:43:32,623 INFO L225 Difference]: With dead ends: 33589 [2018-11-12 16:43:32,623 INFO L226 Difference]: Without dead ends: 18410 [2018-11-12 16:43:32,662 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 393 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=1011, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 16:43:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18410 states. [2018-11-12 16:43:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18410 to 18402. [2018-11-12 16:43:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18402 states. [2018-11-12 16:43:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18402 states to 18402 states and 23170 transitions. [2018-11-12 16:43:33,006 INFO L78 Accepts]: Start accepts. Automaton has 18402 states and 23170 transitions. Word has length 378 [2018-11-12 16:43:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:43:33,007 INFO L480 AbstractCegarLoop]: Abstraction has 18402 states and 23170 transitions. [2018-11-12 16:43:33,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 16:43:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18402 states and 23170 transitions. [2018-11-12 16:43:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-12 16:43:33,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:43:33,032 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:43:33,032 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:43:33,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:43:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1905769043, now seen corresponding path program 1 times [2018-11-12 16:43:33,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:43:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:43:33,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:43:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:43:33,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:43:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:43:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-12 16:43:33,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:43:33,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:43:33,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:43:33,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:43:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:43:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:43:33,646 INFO L87 Difference]: Start difference. First operand 18402 states and 23170 transitions. Second operand 4 states. [2018-11-12 16:43:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:43:37,590 INFO L93 Difference]: Finished difference Result 45243 states and 60517 transitions. [2018-11-12 16:43:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:43:37,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 459 [2018-11-12 16:43:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:43:37,710 INFO L225 Difference]: With dead ends: 45243 [2018-11-12 16:43:37,710 INFO L226 Difference]: Without dead ends: 29724 [2018-11-12 16:43:37,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 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 16:43:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29724 states. [2018-11-12 16:43:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29724 to 29174. [2018-11-12 16:43:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29174 states. [2018-11-12 16:43:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29174 states to 29174 states and 36403 transitions. [2018-11-12 16:43:38,355 INFO L78 Accepts]: Start accepts. Automaton has 29174 states and 36403 transitions. Word has length 459 [2018-11-12 16:43:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:43:38,356 INFO L480 AbstractCegarLoop]: Abstraction has 29174 states and 36403 transitions. [2018-11-12 16:43:38,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:43:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 29174 states and 36403 transitions. [2018-11-12 16:43:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-11-12 16:43:38,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:43:38,429 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:43:38,429 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:43:38,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:43:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1374650610, now seen corresponding path program 1 times [2018-11-12 16:43:38,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:43:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:43:38,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:43:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:43:38,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:43:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:43:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 212 proven. 305 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-12 16:43:40,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:43:40,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:43:40,154 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 677 with the following transitions: [2018-11-12 16:43:40,154 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [359], [361], [364], [372], [380], [388], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [972], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1048], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-12 16:43:40,159 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:43:40,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:43:40,614 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:43:41,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:43:41,786 INFO L272 AbstractInterpreter]: Visited 251 different actions 992 times. Merged at 7 different actions 24 times. Never widened. Performed 15626 root evaluator evaluations with a maximum evaluation depth of 6. Performed 15626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:43:41,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:43:41,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:43:41,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:43:41,796 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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:43:41,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:43:41,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:43:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:43:42,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:43:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 637 proven. 2 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-11-12 16:43:42,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:43:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 212 proven. 305 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-12 16:43:43,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:43:43,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2018-11-12 16:43:43,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:43:43,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 16:43:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 16:43:43,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-12 16:43:43,767 INFO L87 Difference]: Start difference. First operand 29174 states and 36403 transitions. Second operand 16 states. [2018-11-12 16:43:44,264 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-12 16:43:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:43:57,196 INFO L93 Difference]: Finished difference Result 58849 states and 75427 transitions. [2018-11-12 16:43:57,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 16:43:57,197 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 676 [2018-11-12 16:43:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:43:57,291 INFO L225 Difference]: With dead ends: 58849 [2018-11-12 16:43:57,291 INFO L226 Difference]: Without dead ends: 24775 [2018-11-12 16:43:57,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1435 GetRequests, 1379 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=717, Invalid=2589, Unknown=0, NotChecked=0, Total=3306 [2018-11-12 16:43:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24775 states. [2018-11-12 16:43:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24775 to 23896. [2018-11-12 16:43:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23896 states. [2018-11-12 16:43:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23896 states to 23896 states and 26610 transitions. [2018-11-12 16:43:58,092 INFO L78 Accepts]: Start accepts. Automaton has 23896 states and 26610 transitions. Word has length 676 [2018-11-12 16:43:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:43:58,092 INFO L480 AbstractCegarLoop]: Abstraction has 23896 states and 26610 transitions. [2018-11-12 16:43:58,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 16:43:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23896 states and 26610 transitions. [2018-11-12 16:43:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2018-11-12 16:43:58,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:43:58,126 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:43:58,127 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:43:58,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:43:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash 956006963, now seen corresponding path program 1 times [2018-11-12 16:43:58,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:43:58,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:43:58,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:43:58,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:43:58,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:43:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-12 16:43:58,315 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-12 16:43:58,321 INFO L168 Benchmark]: Toolchain (without parser) took 211990.34 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-12 16:43:58,322 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 16:43:58,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1411.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-12 16:43:58,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -871.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-11-12 16:43:58,324 INFO L168 Benchmark]: Boogie Preprocessor took 154.76 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 16:43:58,325 INFO L168 Benchmark]: RCFGBuilder took 6689.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 265.3 MB). Peak memory consumption was 265.3 MB. Max. memory is 7.1 GB. [2018-11-12 16:43:58,326 INFO L168 Benchmark]: TraceAbstraction took 203543.26 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.6 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-12 16:43:58,331 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1411.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 185.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -871.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.76 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 6689.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 265.3 MB). Peak memory consumption was 265.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203543.26 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.6 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown