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_label50_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:38:26,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:38:26,344 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:38:26,361 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:38:26,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:38:26,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:38:26,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:38:26,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:38:26,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:38:26,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:38:26,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:38:26,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:38:26,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:38:26,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:38:26,387 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:38:26,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:38:26,391 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:38:26,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:38:26,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:38:26,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:38:26,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:38:26,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:38:26,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:38:26,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:38:26,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:38:26,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:38:26,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:38:26,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:38:26,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:38:26,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:38:26,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:38:26,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:38:26,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:38:26,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:38:26,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:38:26,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:38:26,420 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:38:26,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:38:26,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:38:26,446 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:38:26,446 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:38:26,446 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:38:26,447 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:38:26,450 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:38:26,450 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:38:26,450 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:38:26,450 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:38:26,450 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:38:26,451 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:38:26,451 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:38:26,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:38:26,452 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:38:26,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:38:26,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:38:26,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:38:26,453 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:38:26,453 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:38:26,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:38:26,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:38:26,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:38:26,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:38:26,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:38:26,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:38:26,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:38:26,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:38:26,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:38:26,457 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:38:26,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:38:26,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:38:26,457 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:38:26,457 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:38:26,457 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:38:26,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:38:26,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:38:26,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:38:26,530 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:38:26,530 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:38:26,531 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2018-11-07 20:38:26,609 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb72f899/d669fbf2fa3e48aaae7c85edb957e3ca/FLAGe2d48e907 [2018-11-07 20:38:27,217 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:38:27,218 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2018-11-07 20:38:27,232 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb72f899/d669fbf2fa3e48aaae7c85edb957e3ca/FLAGe2d48e907 [2018-11-07 20:38:27,249 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb72f899/d669fbf2fa3e48aaae7c85edb957e3ca [2018-11-07 20:38:27,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:38:27,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:38:27,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:38:27,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:38:27,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:38:27,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:38:27" (1/1) ... [2018-11-07 20:38:27,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b29a96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:27, skipping insertion in model container [2018-11-07 20:38:27,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:38:27" (1/1) ... [2018-11-07 20:38:27,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:38:27,359 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:38:27,863 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:38:27,869 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:38:28,047 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:38:28,065 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:38:28,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28 WrapperNode [2018-11-07 20:38:28,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:38:28,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:38:28,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:38:28,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:38:28,077 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:38:28" (1/1) ... [2018-11-07 20:38:28,208 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:38:28" (1/1) ... [2018-11-07 20:38:28,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:38:28,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:38:28,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:38:28,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:38:28,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (1/1) ... [2018-11-07 20:38:28,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (1/1) ... [2018-11-07 20:38:28,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (1/1) ... [2018-11-07 20:38:28,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (1/1) ... [2018-11-07 20:38:28,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (1/1) ... [2018-11-07 20:38:28,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (1/1) ... [2018-11-07 20:38:28,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (1/1) ... [2018-11-07 20:38:28,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:38:28,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:38:28,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:38:28,331 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:38:28,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (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:38:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:38:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:38:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:38:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:38:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:38:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:38:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:38:31,854 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:38:31,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:38:31 BoogieIcfgContainer [2018-11-07 20:38:31,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:38:31,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:38:31,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:38:31,860 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:38:31,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:38:27" (1/3) ... [2018-11-07 20:38:31,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1cdbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:38:31, skipping insertion in model container [2018-11-07 20:38:31,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:38:28" (2/3) ... [2018-11-07 20:38:31,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1cdbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:38:31, skipping insertion in model container [2018-11-07 20:38:31,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:38:31" (3/3) ... [2018-11-07 20:38:31,864 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label50_true-unreach-call_false-termination.c [2018-11-07 20:38:31,875 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:38:31,885 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:38:31,902 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:38:31,938 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:38:31,938 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:38:31,938 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:38:31,939 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:38:31,939 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:38:31,939 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:38:31,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:38:31,939 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:38:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:38:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 20:38:31,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:31,981 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] [2018-11-07 20:38:31,984 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:31,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -50157732, now seen corresponding path program 1 times [2018-11-07 20:38:31,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:32,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:32,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:32,388 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:38:32,496 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:38:32,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:38:32,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:38:32,499 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:32,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:38:32,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:38:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:38:32,525 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:38:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:34,358 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:38:34,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:38:34,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-07 20:38:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:34,380 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:38:34,380 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:38:34,389 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:38:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:38:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:38:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:38:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-07 20:38:34,470 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 44 [2018-11-07 20:38:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:34,471 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-07 20:38:34,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:38:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-07 20:38:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 20:38:34,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:34,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:34,479 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:34,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:34,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1724157031, now seen corresponding path program 1 times [2018-11-07 20:38:34,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:34,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:34,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:34,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:38:34,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:38:34,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:38:34,888 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:34,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:38:34,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:38:34,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:38:34,891 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-07 20:38:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:36,884 INFO L93 Difference]: Finished difference Result 1062 states and 1897 transitions. [2018-11-07 20:38:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:38:36,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-11-07 20:38:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:36,891 INFO L225 Difference]: With dead ends: 1062 [2018-11-07 20:38:36,891 INFO L226 Difference]: Without dead ends: 634 [2018-11-07 20:38:36,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:38:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-07 20:38:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2018-11-07 20:38:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-11-07 20:38:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1019 transitions. [2018-11-07 20:38:36,931 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1019 transitions. Word has length 131 [2018-11-07 20:38:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:36,932 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 1019 transitions. [2018-11-07 20:38:36,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:38:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1019 transitions. [2018-11-07 20:38:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 20:38:36,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:36,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,939 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:36,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash 415093804, now seen corresponding path program 1 times [2018-11-07 20:38:36,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:36,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:36,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:36,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:36,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:38:37,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:38:37,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:38:37,259 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:37,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:38:37,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:38:37,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:38:37,266 INFO L87 Difference]: Start difference. First operand 625 states and 1019 transitions. Second operand 4 states. [2018-11-07 20:38:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:41,461 INFO L93 Difference]: Finished difference Result 2352 states and 4010 transitions. [2018-11-07 20:38:41,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:38:41,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-11-07 20:38:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:41,487 INFO L225 Difference]: With dead ends: 2352 [2018-11-07 20:38:41,487 INFO L226 Difference]: Without dead ends: 1733 [2018-11-07 20:38:41,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:38:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2018-11-07 20:38:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2018-11-07 20:38:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2018-11-07 20:38:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2668 transitions. [2018-11-07 20:38:41,578 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2668 transitions. Word has length 140 [2018-11-07 20:38:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:41,579 INFO L480 AbstractCegarLoop]: Abstraction has 1733 states and 2668 transitions. [2018-11-07 20:38:41,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:38:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2668 transitions. [2018-11-07 20:38:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-07 20:38:41,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:41,599 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:38:41,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:41,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:41,599 INFO L82 PathProgramCache]: Analyzing trace with hash -872463117, now seen corresponding path program 1 times [2018-11-07 20:38:41,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:41,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:41,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:41,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:41,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:42,191 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-07 20:38:42,432 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-11-07 20:38:42,813 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2018-11-07 20:38:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 147 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:38:43,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:43,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:43,497 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-11-07 20:38:43,501 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [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], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:43,547 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:43,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:44,282 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:44,303 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:44,304 INFO L272 AbstractInterpreter]: Visited 125 different actions 125 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:38:44,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:44,339 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:45,098 INFO L227 lantSequenceWeakener]: Weakened 268 states. On average, predicates are now at 77.7% of their original sizes. [2018-11-07 20:38:45,098 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:45,462 INFO L415 sIntCurrentIteration]: We unified 276 AI predicates to 276 [2018-11-07 20:38:45,462 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:45,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:45,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2018-11-07 20:38:45,464 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:45,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:38:45,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:38:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:38:45,466 INFO L87 Difference]: Start difference. First operand 1733 states and 2668 transitions. Second operand 7 states. [2018-11-07 20:39:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:01,079 INFO L93 Difference]: Finished difference Result 3645 states and 5630 transitions. [2018-11-07 20:39:01,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:39:01,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 277 [2018-11-07 20:39:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:01,091 INFO L225 Difference]: With dead ends: 3645 [2018-11-07 20:39:01,092 INFO L226 Difference]: Without dead ends: 1918 [2018-11-07 20:39:01,101 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 277 GetRequests, 271 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:39:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2018-11-07 20:39:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1916. [2018-11-07 20:39:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2018-11-07 20:39:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2859 transitions. [2018-11-07 20:39:01,163 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2859 transitions. Word has length 277 [2018-11-07 20:39:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:01,163 INFO L480 AbstractCegarLoop]: Abstraction has 1916 states and 2859 transitions. [2018-11-07 20:39:01,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:39:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2859 transitions. [2018-11-07 20:39:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-07 20:39:01,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:01,177 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:39:01,178 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:01,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:01,178 INFO L82 PathProgramCache]: Analyzing trace with hash 594401252, now seen corresponding path program 1 times [2018-11-07 20:39:01,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:01,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:01,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:01,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:01,181 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:01,691 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:39:01,897 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:39:02,132 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:39:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 199 proven. 190 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:39:02,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:02,715 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:02,716 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 363 with the following transitions: [2018-11-07 20:39:02,716 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [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], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:39:02,721 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:02,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:02,835 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:02,963 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:02,963 INFO L272 AbstractInterpreter]: Visited 129 different actions 251 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:39:03,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:03,002 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:03,894 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 77.51% of their original sizes. [2018-11-07 20:39:03,895 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:05,260 INFO L415 sIntCurrentIteration]: We unified 361 AI predicates to 361 [2018-11-07 20:39:05,260 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:05,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:05,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-11-07 20:39:05,261 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:05,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:39:05,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:39:05,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:39:05,264 INFO L87 Difference]: Start difference. First operand 1916 states and 2859 transitions. Second operand 19 states. [2018-11-07 20:39:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:31,172 INFO L93 Difference]: Finished difference Result 4614 states and 6687 transitions. [2018-11-07 20:39:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 20:39:31,172 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 362 [2018-11-07 20:39:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:31,184 INFO L225 Difference]: With dead ends: 4614 [2018-11-07 20:39:31,185 INFO L226 Difference]: Without dead ends: 2286 [2018-11-07 20:39:31,195 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 370 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:39:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2018-11-07 20:39:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2284. [2018-11-07 20:39:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-11-07 20:39:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3235 transitions. [2018-11-07 20:39:31,259 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3235 transitions. Word has length 362 [2018-11-07 20:39:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:31,260 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3235 transitions. [2018-11-07 20:39:31,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:39:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3235 transitions. [2018-11-07 20:39:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-07 20:39:31,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:31,276 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:39:31,277 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:31,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash 240354552, now seen corresponding path program 1 times [2018-11-07 20:39:31,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:31,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:31,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:31,775 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:39:31,952 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:39:32,176 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:39:32,557 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 20:39:32,849 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-07 20:39:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 124 proven. 317 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:39:33,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:33,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:33,629 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 389 with the following transitions: [2018-11-07 20:39:33,629 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [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], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:39:33,633 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:33,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:33,739 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:33,840 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:33,840 INFO L272 AbstractInterpreter]: Visited 129 different actions 254 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:39:33,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:33,845 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:34,379 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 80.22% of their original sizes. [2018-11-07 20:39:34,380 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:35,076 INFO L415 sIntCurrentIteration]: We unified 387 AI predicates to 387 [2018-11-07 20:39:35,076 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:35,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:35,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [15] total 34 [2018-11-07 20:39:35,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:35,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:39:35,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:39:35,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:39:35,079 INFO L87 Difference]: Start difference. First operand 2284 states and 3235 transitions. Second operand 21 states. [2018-11-07 20:39:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:56,409 INFO L93 Difference]: Finished difference Result 4382 states and 6469 transitions. [2018-11-07 20:39:56,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:39:56,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 388 [2018-11-07 20:39:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:56,423 INFO L225 Difference]: With dead ends: 4382 [2018-11-07 20:39:56,423 INFO L226 Difference]: Without dead ends: 2655 [2018-11-07 20:39:56,432 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 404 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 20:39:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2018-11-07 20:39:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2469. [2018-11-07 20:39:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2018-11-07 20:39:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3427 transitions. [2018-11-07 20:39:56,491 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3427 transitions. Word has length 388 [2018-11-07 20:39:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:56,491 INFO L480 AbstractCegarLoop]: Abstraction has 2469 states and 3427 transitions. [2018-11-07 20:39:56,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:39:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3427 transitions. [2018-11-07 20:39:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-11-07 20:39:56,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:56,506 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:39:56,506 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:56,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1875261716, now seen corresponding path program 1 times [2018-11-07 20:39:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:56,508 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 227 proven. 225 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:39:57,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:57,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:57,304 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2018-11-07 20:39:57,305 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [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], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:39:57,308 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:57,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:57,359 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:58,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:58,113 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:39:58,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:58,116 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:58,507 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 77.51% of their original sizes. [2018-11-07 20:39:58,508 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:58,897 INFO L415 sIntCurrentIteration]: We unified 397 AI predicates to 397 [2018-11-07 20:39:58,898 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:58,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:58,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-11-07 20:39:58,899 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:58,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:39:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:39:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:39:58,901 INFO L87 Difference]: Start difference. First operand 2469 states and 3427 transitions. Second operand 19 states. [2018-11-07 20:40:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:16,533 INFO L93 Difference]: Finished difference Result 4987 states and 7066 transitions. [2018-11-07 20:40:16,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 20:40:16,534 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 398 [2018-11-07 20:40:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:16,545 INFO L225 Difference]: With dead ends: 4987 [2018-11-07 20:40:16,546 INFO L226 Difference]: Without dead ends: 2659 [2018-11-07 20:40:16,554 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 406 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:40:16,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2018-11-07 20:40:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2471. [2018-11-07 20:40:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2018-11-07 20:40:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3428 transitions. [2018-11-07 20:40:16,618 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3428 transitions. Word has length 398 [2018-11-07 20:40:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:16,619 INFO L480 AbstractCegarLoop]: Abstraction has 2471 states and 3428 transitions. [2018-11-07 20:40:16,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:40:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3428 transitions. [2018-11-07 20:40:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-11-07 20:40:16,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:40:16,631 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:16,631 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:40:16,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1786945447, now seen corresponding path program 1 times [2018-11-07 20:40:16,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:40:16,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:16,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:40:16,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:16,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:40:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:40:17,136 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:40:17,332 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:40:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 211 proven. 241 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:40:18,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:40:18,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:40:18,672 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 424 with the following transitions: [2018-11-07 20:40:18,673 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [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], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [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:40:18,678 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:40:18,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:40:18,755 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:40:19,043 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:40:19,043 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:40:19,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:19,086 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:40:19,659 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 77.52% of their original sizes. [2018-11-07 20:40:19,660 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:40:20,282 INFO L415 sIntCurrentIteration]: We unified 422 AI predicates to 422 [2018-11-07 20:40:20,283 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:40:20,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:40:20,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 28 [2018-11-07 20:40:20,283 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:40:20,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:40:20,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:40:20,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:40:20,286 INFO L87 Difference]: Start difference. First operand 2471 states and 3428 transitions. Second operand 17 states. [2018-11-07 20:40:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:36,437 INFO L93 Difference]: Finished difference Result 4987 states and 7066 transitions. [2018-11-07 20:40:36,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:40:36,438 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 423 [2018-11-07 20:40:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:36,449 INFO L225 Difference]: With dead ends: 4987 [2018-11-07 20:40:36,449 INFO L226 Difference]: Without dead ends: 2659 [2018-11-07 20:40:36,457 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 430 GetRequests, 401 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:40:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2018-11-07 20:40:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2471. [2018-11-07 20:40:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2018-11-07 20:40:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3428 transitions. [2018-11-07 20:40:36,519 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3428 transitions. Word has length 423 [2018-11-07 20:40:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:36,520 INFO L480 AbstractCegarLoop]: Abstraction has 2471 states and 3428 transitions. [2018-11-07 20:40:36,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:40:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3428 transitions. [2018-11-07 20:40:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-07 20:40:36,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:40:36,532 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,532 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:40:36,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash -235966888, now seen corresponding path program 1 times [2018-11-07 20:40:36,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:40:36,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:36,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:40:36,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:36,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:40:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:40:36,980 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:40:37,185 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:40:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 198 proven. 254 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:40:38,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:40:38,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:40:38,163 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 437 with the following transitions: [2018-11-07 20:40:38,163 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [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], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [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:40:38,167 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:40:38,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:40:38,238 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:40:38,487 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:40:38,487 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:40:38,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:38,496 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:40:39,126 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 77.52% of their original sizes. [2018-11-07 20:40:39,127 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:40:39,757 INFO L415 sIntCurrentIteration]: We unified 435 AI predicates to 435 [2018-11-07 20:40:39,758 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:40:39,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:40:39,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [12] total 28 [2018-11-07 20:40:39,758 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:40:39,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:40:39,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:40:39,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:40:39,760 INFO L87 Difference]: Start difference. First operand 2471 states and 3428 transitions. Second operand 18 states. [2018-11-07 20:40:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:59,681 INFO L93 Difference]: Finished difference Result 4987 states and 7066 transitions. [2018-11-07 20:40:59,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:40:59,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 436 [2018-11-07 20:40:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:59,691 INFO L225 Difference]: With dead ends: 4987 [2018-11-07 20:40:59,691 INFO L226 Difference]: Without dead ends: 2659 [2018-11-07 20:40:59,700 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 444 GetRequests, 413 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-11-07 20:40:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2018-11-07 20:40:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2471. [2018-11-07 20:40:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2018-11-07 20:40:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3428 transitions. [2018-11-07 20:40:59,760 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3428 transitions. Word has length 436 [2018-11-07 20:40:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:59,761 INFO L480 AbstractCegarLoop]: Abstraction has 2471 states and 3428 transitions. [2018-11-07 20:40:59,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:40:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3428 transitions. [2018-11-07 20:40:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-11-07 20:40:59,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:40:59,773 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,773 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:40:59,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash 201595056, now seen corresponding path program 1 times [2018-11-07 20:40:59,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:40:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:59,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:40:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:59,775 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:40:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:41:00,260 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:41:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 186 proven. 266 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:41:00,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:41:00,871 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:41:00,871 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 449 with the following transitions: [2018-11-07 20:41:00,871 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [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], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [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:41:00,874 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:41:00,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:41:00,962 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:41:01,197 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:41:01,197 INFO L272 AbstractInterpreter]: Visited 180 different actions 356 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:41:01,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:01,208 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:41:02,198 INFO L227 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 77.47% of their original sizes. [2018-11-07 20:41:02,198 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:41:02,839 INFO L415 sIntCurrentIteration]: We unified 447 AI predicates to 447 [2018-11-07 20:41:02,839 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:41:02,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:41:02,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [14] total 33 [2018-11-07 20:41:02,840 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:41:02,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:41:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:41:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:41:02,842 INFO L87 Difference]: Start difference. First operand 2471 states and 3428 transitions. Second operand 21 states. [2018-11-07 20:41:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:41:26,386 INFO L93 Difference]: Finished difference Result 4985 states and 7064 transitions. [2018-11-07 20:41:26,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:41:26,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 448 [2018-11-07 20:41:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:41:26,397 INFO L225 Difference]: With dead ends: 4985 [2018-11-07 20:41:26,397 INFO L226 Difference]: Without dead ends: 2657 [2018-11-07 20:41:26,405 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 455 GetRequests, 422 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-11-07 20:41:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2018-11-07 20:41:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2469. [2018-11-07 20:41:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2018-11-07 20:41:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3426 transitions. [2018-11-07 20:41:26,457 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3426 transitions. Word has length 448 [2018-11-07 20:41:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:41:26,458 INFO L480 AbstractCegarLoop]: Abstraction has 2469 states and 3426 transitions. [2018-11-07 20:41:26,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:41:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3426 transitions. [2018-11-07 20:41:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-11-07 20:41:26,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:41:26,469 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:41:26,469 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:41:26,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:26,470 INFO L82 PathProgramCache]: Analyzing trace with hash 600900248, now seen corresponding path program 1 times [2018-11-07 20:41:26,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:41:26,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:26,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:41:26,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:26,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:41:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:41:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 259 proven. 483 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:41:27,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:41:27,633 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:41:27,633 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 477 with the following transitions: [2018-11-07 20:41:27,633 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [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], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:41:27,635 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:41:27,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:41:27,689 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:41:27,914 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:41:27,914 INFO L272 AbstractInterpreter]: Visited 130 different actions 385 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:41:27,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:27,921 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:41:28,515 INFO L227 lantSequenceWeakener]: Weakened 127 states. On average, predicates are now at 77.49% of their original sizes. [2018-11-07 20:41:28,516 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:41:28,853 INFO L415 sIntCurrentIteration]: We unified 475 AI predicates to 475 [2018-11-07 20:41:28,854 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:41:28,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:41:28,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 30 [2018-11-07 20:41:28,854 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:41:28,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:41:28,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:41:28,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:41:28,856 INFO L87 Difference]: Start difference. First operand 2469 states and 3426 transitions. Second operand 17 states. [2018-11-07 20:41:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:41:44,402 INFO L93 Difference]: Finished difference Result 5237 states and 7337 transitions. [2018-11-07 20:41:44,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 20:41:44,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 476 [2018-11-07 20:41:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:41:44,414 INFO L225 Difference]: With dead ends: 5237 [2018-11-07 20:41:44,414 INFO L226 Difference]: Without dead ends: 2470 [2018-11-07 20:41:44,425 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 489 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-11-07 20:41:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2018-11-07 20:41:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2101. [2018-11-07 20:41:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-11-07 20:41:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 3039 transitions. [2018-11-07 20:41:44,480 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 3039 transitions. Word has length 476 [2018-11-07 20:41:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:41:44,481 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 3039 transitions. [2018-11-07 20:41:44,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:41:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 3039 transitions. [2018-11-07 20:41:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-11-07 20:41:44,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:41:44,493 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:41:44,493 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:41:44,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash -734705564, now seen corresponding path program 1 times [2018-11-07 20:41:44,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:41:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:44,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:41:44,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:44,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:41:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:41:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 380 proven. 112 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-07 20:41:45,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:41:45,046 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:41:45,046 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 499 with the following transitions: [2018-11-07 20:41:45,046 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [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], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [694], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:41:45,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:41:45,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:41:45,102 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:41:45,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:41:45,301 INFO L272 AbstractInterpreter]: Visited 130 different actions 387 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:41:45,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:45,311 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:41:46,063 INFO L227 lantSequenceWeakener]: Weakened 495 states. On average, predicates are now at 80.28% of their original sizes. [2018-11-07 20:41:46,064 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:41:46,186 INFO L415 sIntCurrentIteration]: We unified 497 AI predicates to 497 [2018-11-07 20:41:46,186 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:41:46,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:41:46,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-07 20:41:46,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:41:46,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:41:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:41:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:41:46,188 INFO L87 Difference]: Start difference. First operand 2101 states and 3039 transitions. Second operand 10 states. [2018-11-07 20:41:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:41:50,404 INFO L93 Difference]: Finished difference Result 4216 states and 6319 transitions. [2018-11-07 20:41:50,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:41:50,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 498 [2018-11-07 20:41:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:41:50,415 INFO L225 Difference]: With dead ends: 4216 [2018-11-07 20:41:50,415 INFO L226 Difference]: Without dead ends: 2489 [2018-11-07 20:41:50,425 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 505 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:41:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2018-11-07 20:41:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2477. [2018-11-07 20:41:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2018-11-07 20:41:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3547 transitions. [2018-11-07 20:41:50,480 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3547 transitions. Word has length 498 [2018-11-07 20:41:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:41:50,481 INFO L480 AbstractCegarLoop]: Abstraction has 2477 states and 3547 transitions. [2018-11-07 20:41:50,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:41:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3547 transitions. [2018-11-07 20:41:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2018-11-07 20:41:50,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:41:50,491 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 20:41:50,492 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:41:50,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:50,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1899529555, now seen corresponding path program 1 times [2018-11-07 20:41:50,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:41:50,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:50,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:41:50,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:41:50,493 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:41:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:41:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 382 proven. 329 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 20:41:52,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:41:52,107 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:41:52,107 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 566 with the following transitions: [2018-11-07 20:41:52,107 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], [253], [255], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [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], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [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], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:41:52,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:41:52,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:41:52,350 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:41:53,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:41:53,015 INFO L272 AbstractInterpreter]: Visited 191 different actions 954 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:41:53,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:41:53,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:41:53,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:41:53,024 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:41:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:41:53,034 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:41:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:41:53,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:41:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 673 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-07 20:41:53,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:41:54,028 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2018-11-07 20:41:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 380 proven. 119 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-07 20:41:54,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:41:54,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 20 [2018-11-07 20:41:54,750 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:41:54,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:41:54,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:41:54,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:41:54,752 INFO L87 Difference]: Start difference. First operand 2477 states and 3547 transitions. Second operand 17 states. [2018-11-07 20:41:57,610 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2018-11-07 20:41:58,422 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-11-07 20:41:59,436 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-11-07 20:41:59,699 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-07 20:42:01,712 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-11-07 20:42:03,397 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-11-07 20:42:04,418 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-11-07 20:42:05,646 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2018-11-07 20:42:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:42:08,398 INFO L93 Difference]: Finished difference Result 6063 states and 9148 transitions. [2018-11-07 20:42:08,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 20:42:08,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 565 [2018-11-07 20:42:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:42:08,419 INFO L225 Difference]: With dead ends: 6063 [2018-11-07 20:42:08,419 INFO L226 Difference]: Without dead ends: 3960 [2018-11-07 20:42:08,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1228 GetRequests, 1163 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=916, Invalid=3506, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 20:42:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2018-11-07 20:42:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 3843. [2018-11-07 20:42:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3843 states. [2018-11-07 20:42:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 4965 transitions. [2018-11-07 20:42:08,554 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 4965 transitions. Word has length 565 [2018-11-07 20:42:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:42:08,555 INFO L480 AbstractCegarLoop]: Abstraction has 3843 states and 4965 transitions. [2018-11-07 20:42:08,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:42:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 4965 transitions. [2018-11-07 20:42:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-11-07 20:42:08,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:42:08,567 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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:42:08,568 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:42:08,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:42:08,568 INFO L82 PathProgramCache]: Analyzing trace with hash 757395771, now seen corresponding path program 1 times [2018-11-07 20:42:08,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:42:08,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:42:08,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:42:08,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:42:08,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:42:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 20:42:09,760 WARN L187 SmtUtils]: Removed 8 from assertion stack [2018-11-07 20:42:09,761 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:42:09,766 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:42:09,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:42:09 BoogieIcfgContainer [2018-11-07 20:42:09,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:42:09,768 INFO L168 Benchmark]: Toolchain (without parser) took 222506.00 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -936.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 20:42:09,769 INFO L168 Benchmark]: CDTParser took 0.20 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:42:09,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.74 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-11-07 20:42:09,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:42:09,771 INFO L168 Benchmark]: Boogie Preprocessor took 113.80 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:42:09,771 INFO L168 Benchmark]: RCFGBuilder took 3524.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:42:09,772 INFO L168 Benchmark]: TraceAbstraction took 217910.83 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -290.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-07 20:42:09,777 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.20 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 802.74 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 149.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.80 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3524.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217910.83 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -290.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 115). Cancelled while BasicCegarLoop was analyzing trace of length 572 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 21. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 217.8s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 181.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2812 SDtfs, 27212 SDslu, 2642 SDs, 0 SdLazy, 35740 SolverSat, 3869 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.2s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 5028 GetRequests, 4718 SyntacticMatches, 21 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3843occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9975092680538183 AbsIntWeakeningRatio, 0.07952393832837436 AbsIntAvgWeakeningVarsNumRemoved, 13.120638355423317 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 1449 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 5151 NumberOfCodeBlocks, 5151 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 5701 ConstructedInterpolants, 0 QuantifiedInterpolants, 22448759 SizeOfPredicates, 7 NumberOfNonLiveVariables, 825 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 4371/6949 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown