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/Problem14_label04_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:33:44,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:33:44,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:33:44,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:33:44,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:33:44,300 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:33:44,301 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:33:44,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:33:44,305 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:33:44,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:33:44,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:33:44,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:33:44,308 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:33:44,309 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:33:44,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:33:44,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:33:44,314 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:33:44,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:33:44,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:33:44,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:33:44,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:33:44,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:33:44,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:33:44,328 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:33:44,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:33:44,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:33:44,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:33:44,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:33:44,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:33:44,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:33:44,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:33:44,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:33:44,337 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:33:44,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:33:44,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:33:44,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:33:44,342 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-07 20:33:44,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:33:44,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:33:44,370 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:33:44,370 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:33:44,370 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:33:44,372 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:33:44,372 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:33:44,372 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:33:44,372 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:33:44,372 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:33:44,373 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:33:44,373 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:33:44,373 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:33:44,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:33:44,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:33:44,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:33:44,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:33:44,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:33:44,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:33:44,375 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:33:44,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:33:44,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:33:44,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:33:44,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:33:44,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:33:44,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:33:44,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:33:44,378 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:33:44,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:33:44,379 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:33:44,379 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:33:44,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:33:44,379 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:33:44,380 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:33:44,380 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:33:44,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:33:44,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:33:44,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:33:44,473 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:33:44,473 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:33:44,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label04_true-unreach-call_false-termination.c [2018-11-07 20:33:44,542 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4084362/168c5fbaadfb43ccbe0ca391a0fa5e96/FLAG3a24eabda [2018-11-07 20:33:45,178 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:33:45,179 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label04_true-unreach-call_false-termination.c [2018-11-07 20:33:45,198 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4084362/168c5fbaadfb43ccbe0ca391a0fa5e96/FLAG3a24eabda [2018-11-07 20:33:45,214 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4084362/168c5fbaadfb43ccbe0ca391a0fa5e96 [2018-11-07 20:33:45,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:33:45,226 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:33:45,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:33:45,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:33:45,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:33:45,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:33:45" (1/1) ... [2018-11-07 20:33:45,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5374e26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:45, skipping insertion in model container [2018-11-07 20:33:45,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:33:45" (1/1) ... [2018-11-07 20:33:45,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:33:45,322 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:33:45,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:33:45,832 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:33:46,031 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:33:46,052 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:33:46,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46 WrapperNode [2018-11-07 20:33:46,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:33:46,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:33:46,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:33:46,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:33:46,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:33:46,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:33:46,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:33:46,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:33:46,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... [2018-11-07 20:33:46,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:33:46,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:33:46,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:33:46,336 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:33:46,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:33:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:33:46,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:33:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:33:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:33:46,398 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:33:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:33:46,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:33:46,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:33:46,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:33:49,907 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:33:49,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:49 BoogieIcfgContainer [2018-11-07 20:33:49,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:33:49,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:33:49,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:33:49,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:33:49,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:33:45" (1/3) ... [2018-11-07 20:33:49,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690bd3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:33:49, skipping insertion in model container [2018-11-07 20:33:49,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:33:46" (2/3) ... [2018-11-07 20:33:49,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690bd3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:33:49, skipping insertion in model container [2018-11-07 20:33:49,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:33:49" (3/3) ... [2018-11-07 20:33:49,916 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label04_true-unreach-call_false-termination.c [2018-11-07 20:33:49,924 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:33:49,932 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:33:49,947 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:33:49,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:33:49,986 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:33:49,986 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:33:49,987 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:33:49,987 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:33:49,987 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:33:49,987 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:33:49,987 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:33:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:33:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 20:33:50,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:50,028 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, 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-07 20:33:50,030 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:50,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash -670280511, now seen corresponding path program 1 times [2018-11-07 20:33:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:50,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:50,091 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:50,451 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:33:50,557 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-07 20:33:50,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:33:50,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:33:50,561 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:50,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:33:50,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:33:50,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:33:50,586 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:33:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:52,409 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:33:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:33:52,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-07 20:33:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:52,433 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:33:52,433 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:33:52,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:33:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:33:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:33:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:33:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-07 20:33:52,532 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 59 [2018-11-07 20:33:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:52,533 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-07 20:33:52,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:33:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-07 20:33:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 20:33:52,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:52,542 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, 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] [2018-11-07 20:33:52,542 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:52,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2036233980, now seen corresponding path program 1 times [2018-11-07 20:33:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:52,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:52,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:52,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:52,915 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:33:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:33:52,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:33:52,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:33:52,977 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:52,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:33:52,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:33:52,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:33:52,980 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-07 20:33:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:56,460 INFO L93 Difference]: Finished difference Result 1588 states and 2935 transitions. [2018-11-07 20:33:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:33:56,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-11-07 20:33:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:56,478 INFO L225 Difference]: With dead ends: 1588 [2018-11-07 20:33:56,479 INFO L226 Difference]: Without dead ends: 1160 [2018-11-07 20:33:56,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:33:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-11-07 20:33:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1153. [2018-11-07 20:33:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-11-07 20:33:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1887 transitions. [2018-11-07 20:33:56,598 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1887 transitions. Word has length 129 [2018-11-07 20:33:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:56,599 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 1887 transitions. [2018-11-07 20:33:56,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:33:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1887 transitions. [2018-11-07 20:33:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 20:33:56,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:56,610 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, 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] [2018-11-07 20:33:56,610 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:56,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1284385993, now seen corresponding path program 1 times [2018-11-07 20:33:56,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:56,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:33:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:33:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:33:56,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:56,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:33:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:33:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:33:56,862 INFO L87 Difference]: Start difference. First operand 1153 states and 1887 transitions. Second operand 5 states. [2018-11-07 20:33:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:33:59,382 INFO L93 Difference]: Finished difference Result 2716 states and 4601 transitions. [2018-11-07 20:33:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:33:59,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-11-07 20:33:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:33:59,409 INFO L225 Difference]: With dead ends: 2716 [2018-11-07 20:33:59,409 INFO L226 Difference]: Without dead ends: 1569 [2018-11-07 20:33:59,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:33:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-11-07 20:33:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1538. [2018-11-07 20:33:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-11-07 20:33:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2356 transitions. [2018-11-07 20:33:59,493 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2356 transitions. Word has length 130 [2018-11-07 20:33:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:33:59,493 INFO L480 AbstractCegarLoop]: Abstraction has 1538 states and 2356 transitions. [2018-11-07 20:33:59,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:33:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2356 transitions. [2018-11-07 20:33:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 20:33:59,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:33:59,500 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, 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] [2018-11-07 20:33:59,500 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:33:59,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:33:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash 516676699, now seen corresponding path program 1 times [2018-11-07 20:33:59,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:33:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:59,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:33:59,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:33:59,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:33:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:33:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:33:59,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:33:59,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:33:59,774 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:33:59,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:33:59,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:33:59,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:33:59,776 INFO L87 Difference]: Start difference. First operand 1538 states and 2356 transitions. Second operand 5 states. [2018-11-07 20:34:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:02,230 INFO L93 Difference]: Finished difference Result 4198 states and 6461 transitions. [2018-11-07 20:34:02,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:34:02,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-07 20:34:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:02,247 INFO L225 Difference]: With dead ends: 4198 [2018-11-07 20:34:02,247 INFO L226 Difference]: Without dead ends: 2666 [2018-11-07 20:34:02,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:34:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-07 20:34:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2560. [2018-11-07 20:34:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2018-11-07 20:34:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3629 transitions. [2018-11-07 20:34:02,335 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3629 transitions. Word has length 132 [2018-11-07 20:34:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:02,336 INFO L480 AbstractCegarLoop]: Abstraction has 2560 states and 3629 transitions. [2018-11-07 20:34:02,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:34:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3629 transitions. [2018-11-07 20:34:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 20:34:02,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:02,339 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, 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] [2018-11-07 20:34:02,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:02,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:02,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2124514756, now seen corresponding path program 1 times [2018-11-07 20:34:02,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:02,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:02,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:02,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:02,763 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-11-07 20:34:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:34:03,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:34:03,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 20:34:03,155 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:34:03,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:34:03,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:34:03,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:34:03,156 INFO L87 Difference]: Start difference. First operand 2560 states and 3629 transitions. Second operand 7 states. [2018-11-07 20:34:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:06,358 INFO L93 Difference]: Finished difference Result 6192 states and 9105 transitions. [2018-11-07 20:34:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 20:34:06,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-11-07 20:34:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:06,381 INFO L225 Difference]: With dead ends: 6192 [2018-11-07 20:34:06,381 INFO L226 Difference]: Without dead ends: 3638 [2018-11-07 20:34:06,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-07 20:34:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2018-11-07 20:34:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3084. [2018-11-07 20:34:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3084 states. [2018-11-07 20:34:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4281 transitions. [2018-11-07 20:34:06,494 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4281 transitions. Word has length 133 [2018-11-07 20:34:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:06,495 INFO L480 AbstractCegarLoop]: Abstraction has 3084 states and 4281 transitions. [2018-11-07 20:34:06,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:34:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4281 transitions. [2018-11-07 20:34:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 20:34:06,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:06,503 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:34:06,503 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:06,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1486188283, now seen corresponding path program 1 times [2018-11-07 20:34:06,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:06,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:06,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:06,505 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 176 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:34:07,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:34:07,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:34:07,144 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-11-07 20:34:07,146 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:34:07,193 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:34:07,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:34:07,573 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:34:07,622 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:34:07,623 INFO L272 AbstractInterpreter]: Visited 89 different actions 89 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:34:07,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:07,671 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:34:08,244 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 78.15% of their original sizes. [2018-11-07 20:34:08,245 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:34:08,591 INFO L415 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2018-11-07 20:34:08,591 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:34:08,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:34:08,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2018-11-07 20:34:08,592 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:34:08,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:34:08,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:34:08,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:34:08,594 INFO L87 Difference]: Start difference. First operand 3084 states and 4281 transitions. Second operand 7 states. [2018-11-07 20:34:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:17,363 INFO L93 Difference]: Finished difference Result 6347 states and 8777 transitions. [2018-11-07 20:34:17,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:34:17,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 217 [2018-11-07 20:34:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:17,378 INFO L225 Difference]: With dead ends: 6347 [2018-11-07 20:34:17,379 INFO L226 Difference]: Without dead ends: 3269 [2018-11-07 20:34:17,390 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:34:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2018-11-07 20:34:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3267. [2018-11-07 20:34:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3267 states. [2018-11-07 20:34:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 4472 transitions. [2018-11-07 20:34:17,466 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 4472 transitions. Word has length 217 [2018-11-07 20:34:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:17,467 INFO L480 AbstractCegarLoop]: Abstraction has 3267 states and 4472 transitions. [2018-11-07 20:34:17,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:34:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4472 transitions. [2018-11-07 20:34:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-07 20:34:17,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:17,478 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:34:17,479 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:17,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1576427027, now seen corresponding path program 1 times [2018-11-07 20:34:17,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:17,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:17,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:17,919 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:34:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 243 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:34:18,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:34:18,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:34:18,294 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 303 with the following transitions: [2018-11-07 20:34:18,295 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:34:18,300 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:34:18,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:34:18,366 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:34:18,486 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:34:18,486 INFO L272 AbstractInterpreter]: Visited 94 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:34:18,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:18,522 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:34:19,048 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 78.13% of their original sizes. [2018-11-07 20:34:19,049 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:34:20,260 INFO L415 sIntCurrentIteration]: We unified 301 AI predicates to 301 [2018-11-07 20:34:20,260 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:34:20,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:34:20,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [12] total 33 [2018-11-07 20:34:20,261 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:34:20,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 20:34:20,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 20:34:20,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:34:20,262 INFO L87 Difference]: Start difference. First operand 3267 states and 4472 transitions. Second operand 23 states. [2018-11-07 20:34:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:46,430 INFO L93 Difference]: Finished difference Result 8108 states and 10802 transitions. [2018-11-07 20:34:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:34:46,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 302 [2018-11-07 20:34:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:46,450 INFO L225 Difference]: With dead ends: 8108 [2018-11-07 20:34:46,450 INFO L226 Difference]: Without dead ends: 5030 [2018-11-07 20:34:46,462 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 311 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 20:34:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2018-11-07 20:34:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 4656. [2018-11-07 20:34:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2018-11-07 20:34:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 5948 transitions. [2018-11-07 20:34:46,568 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 5948 transitions. Word has length 302 [2018-11-07 20:34:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:46,568 INFO L480 AbstractCegarLoop]: Abstraction has 4656 states and 5948 transitions. [2018-11-07 20:34:46,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 20:34:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 5948 transitions. [2018-11-07 20:34:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-07 20:34:46,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:46,581 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 20:34:46,581 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:46,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1094759873, now seen corresponding path program 1 times [2018-11-07 20:34:46,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:46,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:46,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:46,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:46,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:46,900 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-07 20:34:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 215 proven. 119 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 20:34:47,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:34:47,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:34:47,136 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 329 with the following transitions: [2018-11-07 20:34:47,136 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:34:47,141 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:34:47,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:34:47,175 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:34:47,285 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:34:47,286 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:34:47,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:47,290 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:34:47,625 INFO L227 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 78.42% of their original sizes. [2018-11-07 20:34:47,625 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:34:47,988 INFO L415 sIntCurrentIteration]: We unified 327 AI predicates to 327 [2018-11-07 20:34:47,988 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:34:47,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:34:47,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [8] total 24 [2018-11-07 20:34:47,989 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:34:47,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:34:47,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:34:47,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:34:47,991 INFO L87 Difference]: Start difference. First operand 4656 states and 5948 transitions. Second operand 18 states. [2018-11-07 20:35:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:04,906 INFO L93 Difference]: Finished difference Result 8107 states and 10668 transitions. [2018-11-07 20:35:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:35:04,906 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 328 [2018-11-07 20:35:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:04,924 INFO L225 Difference]: With dead ends: 8107 [2018-11-07 20:35:04,925 INFO L226 Difference]: Without dead ends: 5029 [2018-11-07 20:35:04,936 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 347 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 20:35:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2018-11-07 20:35:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5024. [2018-11-07 20:35:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5024 states. [2018-11-07 20:35:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 6344 transitions. [2018-11-07 20:35:05,041 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 6344 transitions. Word has length 328 [2018-11-07 20:35:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:05,042 INFO L480 AbstractCegarLoop]: Abstraction has 5024 states and 6344 transitions. [2018-11-07 20:35:05,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:35:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 6344 transitions. [2018-11-07 20:35:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-11-07 20:35:05,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:05,056 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 20:35:05,056 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:05,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:05,057 INFO L82 PathProgramCache]: Analyzing trace with hash -800546699, now seen corresponding path program 1 times [2018-11-07 20:35:05,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:05,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:05,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 169 proven. 214 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:35:05,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:05,816 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:05,817 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 339 with the following transitions: [2018-11-07 20:35:05,817 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:05,821 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:05,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:05,855 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:05,990 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:05,991 INFO L272 AbstractInterpreter]: Visited 130 different actions 253 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:35:05,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:05,997 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:06,408 INFO L227 lantSequenceWeakener]: Weakened 49 states. On average, predicates are now at 79.22% of their original sizes. [2018-11-07 20:35:06,408 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:07,009 INFO L415 sIntCurrentIteration]: We unified 337 AI predicates to 337 [2018-11-07 20:35:07,009 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:07,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:07,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [12] total 28 [2018-11-07 20:35:07,010 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:07,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:35:07,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:35:07,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:35:07,011 INFO L87 Difference]: Start difference. First operand 5024 states and 6344 transitions. Second operand 18 states. [2018-11-07 20:35:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:28,782 INFO L93 Difference]: Finished difference Result 9568 states and 12347 transitions. [2018-11-07 20:35:28,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:35:28,782 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 338 [2018-11-07 20:35:28,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:28,805 INFO L225 Difference]: With dead ends: 9568 [2018-11-07 20:35:28,806 INFO L226 Difference]: Without dead ends: 6490 [2018-11-07 20:35:28,818 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 346 GetRequests, 315 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-11-07 20:35:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6490 states. [2018-11-07 20:35:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6490 to 5676. [2018-11-07 20:35:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5676 states. [2018-11-07 20:35:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 7033 transitions. [2018-11-07 20:35:28,946 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 7033 transitions. Word has length 338 [2018-11-07 20:35:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:28,947 INFO L480 AbstractCegarLoop]: Abstraction has 5676 states and 7033 transitions. [2018-11-07 20:35:28,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:35:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 7033 transitions. [2018-11-07 20:35:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-07 20:35:28,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:28,964 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:35:28,964 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:28,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1143820971, now seen corresponding path program 1 times [2018-11-07 20:35:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:28,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:28,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:28,966 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:29,282 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 20:35:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 363 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:29,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:29,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:29,997 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 355 with the following transitions: [2018-11-07 20:35:29,998 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:30,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:30,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:30,041 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:30,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:35:30,587 INFO L272 AbstractInterpreter]: Visited 121 different actions 597 times. Merged at 8 different actions 39 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:35:30,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:30,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:35:30,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:30,596 INFO L194 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-07 20:35:30,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:30,610 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:35:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:30,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:35:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 305 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-07 20:35:31,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:35:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 305 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-07 20:35:32,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:35:32,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 20:35:32,117 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:35:32,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 20:35:32,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 20:35:32,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-11-07 20:35:32,119 INFO L87 Difference]: Start difference. First operand 5676 states and 7033 transitions. Second operand 14 states. [2018-11-07 20:35:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:39,623 INFO L93 Difference]: Finished difference Result 15791 states and 20656 transitions. [2018-11-07 20:35:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 20:35:39,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 354 [2018-11-07 20:35:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:39,662 INFO L225 Difference]: With dead ends: 15791 [2018-11-07 20:35:39,662 INFO L226 Difference]: Without dead ends: 10860 [2018-11-07 20:35:39,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 733 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=445, Invalid=1717, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 20:35:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2018-11-07 20:35:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 10490. [2018-11-07 20:35:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10490 states. [2018-11-07 20:35:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10490 states to 10490 states and 12529 transitions. [2018-11-07 20:35:39,976 INFO L78 Accepts]: Start accepts. Automaton has 10490 states and 12529 transitions. Word has length 354 [2018-11-07 20:35:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:39,977 INFO L480 AbstractCegarLoop]: Abstraction has 10490 states and 12529 transitions. [2018-11-07 20:35:39,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 20:35:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10490 states and 12529 transitions. [2018-11-07 20:35:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-11-07 20:35:40,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:40,007 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-07 20:35:40,008 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:40,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1365330226, now seen corresponding path program 1 times [2018-11-07 20:35:40,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:40,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:40,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:40,501 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:35:40,679 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:35:40,897 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:35:41,386 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 20:35:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 169 proven. 214 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:35:41,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:41,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:41,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 364 with the following transitions: [2018-11-07 20:35:41,869 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:41,872 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:41,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:41,930 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:42,267 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:42,267 INFO L272 AbstractInterpreter]: Visited 155 different actions 303 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:35:42,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:42,304 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:43,161 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 79.07% of their original sizes. [2018-11-07 20:35:43,161 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:44,142 INFO L415 sIntCurrentIteration]: We unified 362 AI predicates to 362 [2018-11-07 20:35:44,142 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:44,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:44,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 30 [2018-11-07 20:35:44,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:44,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 20:35:44,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 20:35:44,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:35:44,144 INFO L87 Difference]: Start difference. First operand 10490 states and 12529 transitions. Second operand 20 states. [2018-11-07 20:36:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:01,986 INFO L93 Difference]: Finished difference Result 19542 states and 23687 transitions. [2018-11-07 20:36:01,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:36:01,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 363 [2018-11-07 20:36:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:02,021 INFO L225 Difference]: With dead ends: 19542 [2018-11-07 20:36:02,021 INFO L226 Difference]: Without dead ends: 12743 [2018-11-07 20:36:02,040 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 372 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-07 20:36:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12743 states. [2018-11-07 20:36:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12743 to 12490. [2018-11-07 20:36:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12490 states. [2018-11-07 20:36:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12490 states to 12490 states and 14618 transitions. [2018-11-07 20:36:02,258 INFO L78 Accepts]: Start accepts. Automaton has 12490 states and 14618 transitions. Word has length 363 [2018-11-07 20:36:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:02,259 INFO L480 AbstractCegarLoop]: Abstraction has 12490 states and 14618 transitions. [2018-11-07 20:36:02,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 20:36:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 12490 states and 14618 transitions. [2018-11-07 20:36:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-07 20:36:02,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:02,288 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 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] [2018-11-07 20:36:02,288 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:02,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1579032322, now seen corresponding path program 1 times [2018-11-07 20:36:02,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:02,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:02,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:02,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:02,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-11-07 20:36:02,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:36:02,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:36:02,546 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:02,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:36:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:36:02,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:36:02,547 INFO L87 Difference]: Start difference. First operand 12490 states and 14618 transitions. Second operand 3 states. [2018-11-07 20:36:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:03,994 INFO L93 Difference]: Finished difference Result 21048 states and 26339 transitions. [2018-11-07 20:36:04,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:36:04,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-11-07 20:36:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:04,064 INFO L225 Difference]: With dead ends: 21048 [2018-11-07 20:36:04,064 INFO L226 Difference]: Without dead ends: 14249 [2018-11-07 20:36:04,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:36:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14249 states. [2018-11-07 20:36:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14249 to 14217. [2018-11-07 20:36:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14217 states. [2018-11-07 20:36:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14217 states to 14217 states and 16663 transitions. [2018-11-07 20:36:04,338 INFO L78 Accepts]: Start accepts. Automaton has 14217 states and 16663 transitions. Word has length 365 [2018-11-07 20:36:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:04,339 INFO L480 AbstractCegarLoop]: Abstraction has 14217 states and 16663 transitions. [2018-11-07 20:36:04,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:36:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14217 states and 16663 transitions. [2018-11-07 20:36:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-11-07 20:36:04,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:04,373 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 20:36:04,374 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:04,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1080162015, now seen corresponding path program 1 times [2018-11-07 20:36:04,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:04,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:04,804 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 243 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:36:05,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:05,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:05,918 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 377 with the following transitions: [2018-11-07 20:36:05,918 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:05,920 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:05,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:05,946 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:06,162 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:06,163 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:36:06,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:06,174 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:06,669 INFO L227 lantSequenceWeakener]: Weakened 49 states. On average, predicates are now at 79.22% of their original sizes. [2018-11-07 20:36:06,669 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:07,332 INFO L415 sIntCurrentIteration]: We unified 375 AI predicates to 375 [2018-11-07 20:36:07,332 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:07,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:07,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-11-07 20:36:07,333 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:07,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:36:07,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:36:07,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:36:07,334 INFO L87 Difference]: Start difference. First operand 14217 states and 16663 transitions. Second operand 19 states. [2018-11-07 20:36:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:32,335 INFO L93 Difference]: Finished difference Result 24875 states and 29739 transitions. [2018-11-07 20:36:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 20:36:32,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 376 [2018-11-07 20:36:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:32,374 INFO L225 Difference]: With dead ends: 24875 [2018-11-07 20:36:32,374 INFO L226 Difference]: Without dead ends: 16349 [2018-11-07 20:36:32,398 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 385 GetRequests, 352 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2018-11-07 20:36:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16349 states. [2018-11-07 20:36:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16349 to 15153. [2018-11-07 20:36:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15153 states. [2018-11-07 20:36:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15153 states to 15153 states and 17629 transitions. [2018-11-07 20:36:32,638 INFO L78 Accepts]: Start accepts. Automaton has 15153 states and 17629 transitions. Word has length 376 [2018-11-07 20:36:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:32,639 INFO L480 AbstractCegarLoop]: Abstraction has 15153 states and 17629 transitions. [2018-11-07 20:36:32,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:36:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 15153 states and 17629 transitions. [2018-11-07 20:36:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-07 20:36:32,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:32,669 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 20:36:32,669 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:32,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1214468615, now seen corresponding path program 1 times [2018-11-07 20:36:32,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:32,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:32,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 231 proven. 152 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:36:36,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:36,938 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:36,939 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 389 with the following transitions: [2018-11-07 20:36:36,939 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:36,942 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:36,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:36,980 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:37,164 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:37,165 INFO L272 AbstractInterpreter]: Visited 180 different actions 353 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:36:37,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:37,172 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:37,593 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 78.13% of their original sizes. [2018-11-07 20:36:37,593 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:38,075 INFO L415 sIntCurrentIteration]: We unified 387 AI predicates to 387 [2018-11-07 20:36:38,075 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:38,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:38,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [14] total 35 [2018-11-07 20:36:38,075 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:38,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 20:36:38,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 20:36:38,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:36:38,077 INFO L87 Difference]: Start difference. First operand 15153 states and 17629 transitions. Second operand 23 states. [2018-11-07 20:37:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:00,730 INFO L93 Difference]: Finished difference Result 25932 states and 30832 transitions. [2018-11-07 20:37:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:37:00,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 388 [2018-11-07 20:37:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:00,768 INFO L225 Difference]: With dead ends: 25932 [2018-11-07 20:37:00,769 INFO L226 Difference]: Without dead ends: 17406 [2018-11-07 20:37:00,792 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 397 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 20:37:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17406 states. [2018-11-07 20:37:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17406 to 16087. [2018-11-07 20:37:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16087 states. [2018-11-07 20:37:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16087 states to 16087 states and 18592 transitions. [2018-11-07 20:37:01,029 INFO L78 Accepts]: Start accepts. Automaton has 16087 states and 18592 transitions. Word has length 388 [2018-11-07 20:37:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:01,030 INFO L480 AbstractCegarLoop]: Abstraction has 16087 states and 18592 transitions. [2018-11-07 20:37:01,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 20:37:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 16087 states and 18592 transitions. [2018-11-07 20:37:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-07 20:37:01,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:01,048 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:37:01,048 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:01,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2029639823, now seen corresponding path program 1 times [2018-11-07 20:37:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:01,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:01,050 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 301 proven. 154 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-07 20:37:01,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:01,381 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:01,381 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 414 with the following transitions: [2018-11-07 20:37:01,381 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:01,383 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:01,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:01,414 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:01,598 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:01,598 INFO L272 AbstractInterpreter]: Visited 121 different actions 361 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:37:01,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:01,603 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:02,032 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 78.11% of their original sizes. [2018-11-07 20:37:02,032 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:02,383 INFO L415 sIntCurrentIteration]: We unified 412 AI predicates to 412 [2018-11-07 20:37:02,383 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:02,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 20:37:02,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:02,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:37:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:37:02,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:37:02,385 INFO L87 Difference]: Start difference. First operand 16087 states and 18592 transitions. Second operand 18 states. [2018-11-07 20:37:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:20,403 INFO L93 Difference]: Finished difference Result 28572 states and 33652 transitions. [2018-11-07 20:37:20,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 20:37:20,403 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 413 [2018-11-07 20:37:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:20,444 INFO L225 Difference]: With dead ends: 28572 [2018-11-07 20:37:20,444 INFO L226 Difference]: Without dead ends: 20046 [2018-11-07 20:37:20,466 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 425 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-11-07 20:37:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20046 states. [2018-11-07 20:37:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20046 to 20022. [2018-11-07 20:37:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20022 states. [2018-11-07 20:37:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20022 states to 20022 states and 22793 transitions. [2018-11-07 20:37:20,763 INFO L78 Accepts]: Start accepts. Automaton has 20022 states and 22793 transitions. Word has length 413 [2018-11-07 20:37:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:20,764 INFO L480 AbstractCegarLoop]: Abstraction has 20022 states and 22793 transitions. [2018-11-07 20:37:20,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:37:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20022 states and 22793 transitions. [2018-11-07 20:37:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-07 20:37:20,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:20,788 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:37:20,788 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:20,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2080543808, now seen corresponding path program 1 times [2018-11-07 20:37:20,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:20,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:20,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:20,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:20,790 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 319 proven. 362 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:37:21,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:21,515 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:21,515 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 417 with the following transitions: [2018-11-07 20:37:21,516 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:21,518 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:21,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:21,555 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:21,740 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:21,740 INFO L272 AbstractInterpreter]: Visited 121 different actions 358 times. Merged at 7 different actions 17 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:37:21,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:21,742 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:22,129 INFO L227 lantSequenceWeakener]: Weakened 84 states. On average, predicates are now at 77.92% of their original sizes. [2018-11-07 20:37:22,129 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:22,419 INFO L415 sIntCurrentIteration]: We unified 415 AI predicates to 415 [2018-11-07 20:37:22,419 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:22,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:22,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [15] total 29 [2018-11-07 20:37:22,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:22,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 20:37:22,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 20:37:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-07 20:37:22,422 INFO L87 Difference]: Start difference. First operand 20022 states and 22793 transitions. Second operand 16 states. Received shutdown request... [2018-11-07 20:37:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 20:37:26,081 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:37:26,087 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:37:26,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:37:26 BoogieIcfgContainer [2018-11-07 20:37:26,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:37:26,089 INFO L168 Benchmark]: Toolchain (without parser) took 220863.57 ms. Allocated memory was 1.5 GB in the beginning and 4.9 GB in the end (delta: 3.4 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-07 20:37:26,090 INFO L168 Benchmark]: CDTParser took 0.23 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-07 20:37:26,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:37:26,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.9 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:37:26,092 INFO L168 Benchmark]: Boogie Preprocessor took 127.57 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:37:26,092 INFO L168 Benchmark]: RCFGBuilder took 3574.19 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:37:26,093 INFO L168 Benchmark]: TraceAbstraction took 216179.31 ms. Allocated memory was 2.2 GB in the beginning and 4.9 GB in the end (delta: 2.6 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:37:26,097 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.23 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 826.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 151.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.9 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.57 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3574.19 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216179.31 ms. Allocated memory was 2.2 GB in the beginning and 4.9 GB in the end (delta: 2.6 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 160). Cancelled while BasicCegarLoop was constructing difference of abstraction (20022states) and FLOYD_HOARE automaton (currently 16 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (172 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 216.1s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 183.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2782 SDtfs, 40242 SDslu, 2688 SDs, 0 SdLazy, 36072 SolverSat, 4313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.2s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 4054 GetRequests, 3724 SyntacticMatches, 19 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20022occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.0s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9970895174106076 AbsIntWeakeningRatio, 0.09386973180076628 AbsIntAvgWeakeningVarsNumRemoved, 14.462962962962964 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 5087 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 4797 NumberOfCodeBlocks, 4797 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5133 ConstructedInterpolants, 0 QuantifiedInterpolants, 12268917 SizeOfPredicates, 2 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 4209/5761 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown