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/Problem12_label29_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:19:48,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:19:48,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:19:48,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:19:48,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:19:48,312 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:19:48,313 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:19:48,315 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:19:48,316 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:19:48,317 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:19:48,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:19:48,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:19:48,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:19:48,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:19:48,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:19:48,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:19:48,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:19:48,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:19:48,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:19:48,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:19:48,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:19:48,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:19:48,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:19:48,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:19:48,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:19:48,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:19:48,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:19:48,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:19:48,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:19:48,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:19:48,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:19:48,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:19:48,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:19:48,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:19:48,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:19:48,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:19:48,343 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:19:48,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:19:48,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:19:48,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:19:48,374 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:19:48,374 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:19:48,375 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:19:48,375 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:19:48,375 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:19:48,375 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:19:48,375 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:19:48,375 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:19:48,376 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:19:48,376 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:19:48,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:19:48,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:19:48,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:19:48,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:19:48,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:19:48,379 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:19:48,379 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:19:48,379 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:19:48,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:19:48,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:19:48,380 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:19:48,380 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:19:48,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:19:48,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:19:48,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:19:48,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:19:48,382 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:19:48,382 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:19:48,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:19:48,382 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:19:48,382 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:19:48,383 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:19:48,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:19:48,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:19:48,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:19:48,458 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:19:48,458 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:19:48,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label29_true-unreach-call.c [2018-11-07 20:19:48,530 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be52ceec6/91b73a6b6b1a4be2b4d8a25aeae0a57b/FLAG025db2d8c [2018-11-07 20:19:49,375 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:19:49,376 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label29_true-unreach-call.c [2018-11-07 20:19:49,416 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be52ceec6/91b73a6b6b1a4be2b4d8a25aeae0a57b/FLAG025db2d8c [2018-11-07 20:19:49,434 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be52ceec6/91b73a6b6b1a4be2b4d8a25aeae0a57b [2018-11-07 20:19:49,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:19:49,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:19:49,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:19:49,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:19:49,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:19:49,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:49" (1/1) ... [2018-11-07 20:19:49,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378b024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:49, skipping insertion in model container [2018-11-07 20:19:49,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:49" (1/1) ... [2018-11-07 20:19:49,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:19:49,651 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:19:51,014 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:19:51,019 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:19:51,602 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:19:51,636 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:19:51,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51 WrapperNode [2018-11-07 20:19:51,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:19:51,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:19:51,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:19:51,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:19:51,648 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:19:51" (1/1) ... [2018-11-07 20:19:51,946 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:19:51" (1/1) ... [2018-11-07 20:19:51,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:19:51,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:19:51,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:19:51,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:19:51,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (1/1) ... [2018-11-07 20:19:51,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (1/1) ... [2018-11-07 20:19:51,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (1/1) ... [2018-11-07 20:19:51,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (1/1) ... [2018-11-07 20:19:52,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (1/1) ... [2018-11-07 20:19:52,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (1/1) ... [2018-11-07 20:19:52,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (1/1) ... [2018-11-07 20:19:52,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:19:52,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:19:52,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:19:52,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:19:52,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (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:19:52,271 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:19:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:19:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:19:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 20:19:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 20:19:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 20:19:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 20:19:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 20:19:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 20:19:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:19:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:19:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:19:52,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:19:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:19:52,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:20:01,373 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:20:01,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:01 BoogieIcfgContainer [2018-11-07 20:20:01,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:20:01,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:20:01,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:20:01,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:20:01,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:49" (1/3) ... [2018-11-07 20:20:01,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a654e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:01, skipping insertion in model container [2018-11-07 20:20:01,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:51" (2/3) ... [2018-11-07 20:20:01,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a654e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:01, skipping insertion in model container [2018-11-07 20:20:01,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:01" (3/3) ... [2018-11-07 20:20:01,383 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label29_true-unreach-call.c [2018-11-07 20:20:01,394 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:20:01,404 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:20:01,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:20:01,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:20:01,472 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:20:01,472 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:20:01,472 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:20:01,473 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:20:01,473 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:20:01,473 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:20:01,473 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:20:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-11-07 20:20:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 20:20:01,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:20:01,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:20:01,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:20:01,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:20:01,545 INFO L82 PathProgramCache]: Analyzing trace with hash -648066108, now seen corresponding path program 1 times [2018-11-07 20:20:01,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:20:01,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:01,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:20:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:01,610 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:20:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:20:02,154 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-07 20:20:02,176 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:20:02,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:20:02,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:20:02,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:20:02,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:20:02,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:20:02,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:20:02,206 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 4 states. [2018-11-07 20:20:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:20:13,291 INFO L93 Difference]: Finished difference Result 3234 states and 6255 transitions. [2018-11-07 20:20:13,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:20:13,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-07 20:20:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:20:13,360 INFO L225 Difference]: With dead ends: 3234 [2018-11-07 20:20:13,361 INFO L226 Difference]: Without dead ends: 2388 [2018-11-07 20:20:13,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:20:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-11-07 20:20:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2018-11-07 20:20:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2018-11-07 20:20:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3845 transitions. [2018-11-07 20:20:13,588 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3845 transitions. Word has length 62 [2018-11-07 20:20:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:20:13,589 INFO L480 AbstractCegarLoop]: Abstraction has 2388 states and 3845 transitions. [2018-11-07 20:20:13,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:20:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3845 transitions. [2018-11-07 20:20:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 20:20:13,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:20:13,608 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:20:13,609 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:20:13,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:20:13,609 INFO L82 PathProgramCache]: Analyzing trace with hash -267235377, now seen corresponding path program 1 times [2018-11-07 20:20:13,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:20:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:13,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:20:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:13,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:20:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:20:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:20:14,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:20:14,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:20:14,056 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:20:14,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:20:14,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:20:14,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:20:14,059 INFO L87 Difference]: Start difference. First operand 2388 states and 3845 transitions. Second operand 5 states. [2018-11-07 20:20:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:20:26,783 INFO L93 Difference]: Finished difference Result 7257 states and 11780 transitions. [2018-11-07 20:20:26,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 20:20:26,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 20:20:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:20:26,820 INFO L225 Difference]: With dead ends: 7257 [2018-11-07 20:20:26,820 INFO L226 Difference]: Without dead ends: 4875 [2018-11-07 20:20:26,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:20:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2018-11-07 20:20:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4829. [2018-11-07 20:20:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4829 states. [2018-11-07 20:20:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4829 states to 4829 states and 7153 transitions. [2018-11-07 20:20:26,988 INFO L78 Accepts]: Start accepts. Automaton has 4829 states and 7153 transitions. Word has length 143 [2018-11-07 20:20:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:20:26,991 INFO L480 AbstractCegarLoop]: Abstraction has 4829 states and 7153 transitions. [2018-11-07 20:20:26,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:20:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4829 states and 7153 transitions. [2018-11-07 20:20:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 20:20:27,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:20:27,006 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:27,006 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:20:27,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:20:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1673617562, now seen corresponding path program 1 times [2018-11-07 20:20:27,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:20:27,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:27,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:20:27,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:27,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:20:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:20:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:20:27,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:20:27,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:20:27,418 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:20:27,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:20:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:20:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:20:27,419 INFO L87 Difference]: Start difference. First operand 4829 states and 7153 transitions. Second operand 6 states. [2018-11-07 20:20:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:20:34,493 INFO L93 Difference]: Finished difference Result 14643 states and 22384 transitions. [2018-11-07 20:20:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:20:34,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-11-07 20:20:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:20:34,560 INFO L225 Difference]: With dead ends: 14643 [2018-11-07 20:20:34,561 INFO L226 Difference]: Without dead ends: 9820 [2018-11-07 20:20:34,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:20:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2018-11-07 20:20:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 9698. [2018-11-07 20:20:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9698 states. [2018-11-07 20:20:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 14207 transitions. [2018-11-07 20:20:34,853 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 14207 transitions. Word has length 176 [2018-11-07 20:20:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:20:34,853 INFO L480 AbstractCegarLoop]: Abstraction has 9698 states and 14207 transitions. [2018-11-07 20:20:34,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:20:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 14207 transitions. [2018-11-07 20:20:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-07 20:20:34,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:20:34,860 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:20:34,860 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:20:34,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:20:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash 924991159, now seen corresponding path program 1 times [2018-11-07 20:20:34,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:20:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:34,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:20:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:34,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:20:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:20:35,231 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:20:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:20:35,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:20:35,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:20:35,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:20:35,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:20:35,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:20:35,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:20:35,643 INFO L87 Difference]: Start difference. First operand 9698 states and 14207 transitions. Second operand 6 states. [2018-11-07 20:20:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:20:45,551 INFO L93 Difference]: Finished difference Result 33086 states and 50892 transitions. [2018-11-07 20:20:45,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:20:45,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2018-11-07 20:20:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:20:45,657 INFO L225 Difference]: With dead ends: 33086 [2018-11-07 20:20:45,657 INFO L226 Difference]: Without dead ends: 23394 [2018-11-07 20:20:45,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:20:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23394 states. [2018-11-07 20:20:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23394 to 23284. [2018-11-07 20:20:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23284 states. [2018-11-07 20:20:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 33060 transitions. [2018-11-07 20:20:46,281 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 33060 transitions. Word has length 187 [2018-11-07 20:20:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:20:46,282 INFO L480 AbstractCegarLoop]: Abstraction has 23284 states and 33060 transitions. [2018-11-07 20:20:46,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:20:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 33060 transitions. [2018-11-07 20:20:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 20:20:46,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:20:46,287 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:20:46,287 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:20:46,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:20:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash 862970119, now seen corresponding path program 1 times [2018-11-07 20:20:46,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:20:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:46,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:20:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:46,289 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:20:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:20:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:20:46,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:20:46,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:20:46,579 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:20:46,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:20:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:20:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:20:46,581 INFO L87 Difference]: Start difference. First operand 23284 states and 33060 transitions. Second operand 4 states. [2018-11-07 20:20:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:20:55,556 INFO L93 Difference]: Finished difference Result 56002 states and 81191 transitions. [2018-11-07 20:20:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:20:55,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-11-07 20:20:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:20:55,691 INFO L225 Difference]: With dead ends: 56002 [2018-11-07 20:20:55,691 INFO L226 Difference]: Without dead ends: 32724 [2018-11-07 20:20:55,785 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:20:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32724 states. [2018-11-07 20:20:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32724 to 32714. [2018-11-07 20:20:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32714 states. [2018-11-07 20:20:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32714 states to 32714 states and 42365 transitions. [2018-11-07 20:20:56,549 INFO L78 Accepts]: Start accepts. Automaton has 32714 states and 42365 transitions. Word has length 211 [2018-11-07 20:20:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:20:56,550 INFO L480 AbstractCegarLoop]: Abstraction has 32714 states and 42365 transitions. [2018-11-07 20:20:56,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:20:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 32714 states and 42365 transitions. [2018-11-07 20:20:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-07 20:20:56,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:20:56,555 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:20:56,556 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:20:56,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:20:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1084674450, now seen corresponding path program 1 times [2018-11-07 20:20:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:20:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:56,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:20:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:20:56,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:20:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:20:56,830 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:20:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 20:20:57,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:20:57,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:20:57,068 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-07 20:20:57,071 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2263], [2265], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2680], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:20:57,125 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:20:57,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:20:57,851 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:20:58,875 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:20:58,877 INFO L272 AbstractInterpreter]: Visited 157 different actions 308 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:20:58,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:20:58,925 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:20:59,899 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 78.26% of their original sizes. [2018-11-07 20:20:59,899 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:21:00,472 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-11-07 20:21:00,473 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:21:00,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:21:00,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [4] total 18 [2018-11-07 20:21:00,477 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:21:00,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 20:21:00,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 20:21:00,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-07 20:21:00,479 INFO L87 Difference]: Start difference. First operand 32714 states and 42365 transitions. Second operand 16 states. [2018-11-07 20:22:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:22:13,634 INFO L93 Difference]: Finished difference Result 68565 states and 88850 transitions. [2018-11-07 20:22:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:22:13,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 212 [2018-11-07 20:22:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:22:13,750 INFO L225 Difference]: With dead ends: 68565 [2018-11-07 20:22:13,750 INFO L226 Difference]: Without dead ends: 35857 [2018-11-07 20:22:13,796 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-11-07 20:22:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35857 states. [2018-11-07 20:22:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35857 to 35848. [2018-11-07 20:22:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35848 states. [2018-11-07 20:22:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35848 states to 35848 states and 45667 transitions. [2018-11-07 20:22:14,416 INFO L78 Accepts]: Start accepts. Automaton has 35848 states and 45667 transitions. Word has length 212 [2018-11-07 20:22:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:22:14,417 INFO L480 AbstractCegarLoop]: Abstraction has 35848 states and 45667 transitions. [2018-11-07 20:22:14,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 20:22:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 35848 states and 45667 transitions. [2018-11-07 20:22:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-07 20:22:14,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:22:14,428 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:22:14,429 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:22:14,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:22:14,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1503195216, now seen corresponding path program 1 times [2018-11-07 20:22:14,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:22:14,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:14,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:22:14,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:22:14,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:22:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:22:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 184 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:22:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:22:15,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:22:15,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 307 with the following transitions: [2018-11-07 20:22:15,045 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2263], [2265], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2693], [2697], [2701], [2705], [2709], [2713], [2717], [2721], [2725], [2729], [2733], [2737], [2741], [2745], [2749], [2752], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:22:15,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:22:15,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:22:15,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:22:15,424 INFO L272 AbstractInterpreter]: Visited 176 different actions 345 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:22:15,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:22:15,430 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:22:15,829 INFO L227 lantSequenceWeakener]: Weakened 303 states. On average, predicates are now at 75.58% of their original sizes. [2018-11-07 20:22:15,830 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:22:15,952 INFO L415 sIntCurrentIteration]: We unified 305 AI predicates to 305 [2018-11-07 20:22:15,952 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:22:15,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:22:15,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 20:22:15,953 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:22:15,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:22:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:22:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:22:15,954 INFO L87 Difference]: Start difference. First operand 35848 states and 45667 transitions. Second operand 11 states. [2018-11-07 20:22:18,098 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:22:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:22:59,786 INFO L93 Difference]: Finished difference Result 70096 states and 89752 transitions. [2018-11-07 20:22:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 20:22:59,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 306 [2018-11-07 20:22:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:22:59,880 INFO L225 Difference]: With dead ends: 70096 [2018-11-07 20:22:59,881 INFO L226 Difference]: Without dead ends: 35848 [2018-11-07 20:22:59,922 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 314 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:22:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35848 states. [2018-11-07 20:23:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35848 to 35848. [2018-11-07 20:23:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35848 states. [2018-11-07 20:23:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35848 states to 35848 states and 45663 transitions. [2018-11-07 20:23:00,479 INFO L78 Accepts]: Start accepts. Automaton has 35848 states and 45663 transitions. Word has length 306 [2018-11-07 20:23:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:23:00,479 INFO L480 AbstractCegarLoop]: Abstraction has 35848 states and 45663 transitions. [2018-11-07 20:23:00,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:23:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 35848 states and 45663 transitions. [2018-11-07 20:23:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-07 20:23:00,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:23:00,491 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:00,491 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:23:00,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:23:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash -111704288, now seen corresponding path program 1 times [2018-11-07 20:23:00,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:23:00,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:23:00,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:23:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:23:00,493 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:23:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:23:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-07 20:23:00,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:23:00,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:23:00,823 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:23:00,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:23:00,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:23:00,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:23:00,825 INFO L87 Difference]: Start difference. First operand 35848 states and 45663 transitions. Second operand 3 states. [2018-11-07 20:23:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:23:06,951 INFO L93 Difference]: Finished difference Result 82048 states and 108008 transitions. [2018-11-07 20:23:06,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:23:06,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-07 20:23:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:23:07,074 INFO L225 Difference]: With dead ends: 82048 [2018-11-07 20:23:07,074 INFO L226 Difference]: Without dead ends: 47270 [2018-11-07 20:23:07,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:23:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47270 states. [2018-11-07 20:23:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47270 to 46977. [2018-11-07 20:23:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46977 states. [2018-11-07 20:23:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46977 states to 46977 states and 59514 transitions. [2018-11-07 20:23:07,831 INFO L78 Accepts]: Start accepts. Automaton has 46977 states and 59514 transitions. Word has length 330 [2018-11-07 20:23:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:23:07,832 INFO L480 AbstractCegarLoop]: Abstraction has 46977 states and 59514 transitions. [2018-11-07 20:23:07,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:23:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 46977 states and 59514 transitions. [2018-11-07 20:23:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-11-07 20:23:07,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:23:07,858 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:23:07,858 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:23:07,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:23:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash 166147514, now seen corresponding path program 1 times [2018-11-07 20:23:07,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:23:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:23:07,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:23:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:23:07,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:23:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:23:08,210 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:23:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 171 proven. 244 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-07 20:23:08,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:23:08,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:23:08,825 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 451 with the following transitions: [2018-11-07 20:23:08,826 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2263], [2265], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2436], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2692], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-07 20:23:08,837 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:23:08,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:23:08,979 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:23:09,213 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:23:09,214 INFO L272 AbstractInterpreter]: Visited 162 different actions 318 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 20:23:09,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:23:09,222 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:23:09,876 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 77.8% of their original sizes. [2018-11-07 20:23:09,877 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:23:10,406 INFO L415 sIntCurrentIteration]: We unified 449 AI predicates to 449 [2018-11-07 20:23:10,406 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:23:10,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:23:10,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-07 20:23:10,407 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:23:10,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:23:10,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:23:10,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:23:10,408 INFO L87 Difference]: Start difference. First operand 46977 states and 59514 transitions. Second operand 21 states. Received shutdown request... [2018-11-07 20:23:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 20:23:23,824 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:23:23,828 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:23:23,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:23:23 BoogieIcfgContainer [2018-11-07 20:23:23,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:23:23,829 INFO L168 Benchmark]: Toolchain (without parser) took 214382.06 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 188.3 MB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-11-07 20:23:23,831 INFO L168 Benchmark]: CDTParser took 0.21 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:23:23,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2187.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:23:23,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 317.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:23:23,833 INFO L168 Benchmark]: Boogie Preprocessor took 242.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2018-11-07 20:23:23,834 INFO L168 Benchmark]: RCFGBuilder took 9176.44 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 159.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -166.0 MB). Peak memory consumption was 667.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:23:23,835 INFO L168 Benchmark]: TraceAbstraction took 202453.16 ms. Allocated memory was 2.5 GB in the beginning and 4.5 GB in the end (delta: 2.0 GB). Free memory was 2.4 GB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-11-07 20:23:23,840 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2187.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 317.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 242.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9176.44 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 159.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -166.0 MB). Peak memory consumption was 667.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 202453.16 ms. Allocated memory was 2.5 GB in the beginning and 4.5 GB in the end (delta: 2.0 GB). Free memory was 2.4 GB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 177). Cancelled while BasicCegarLoop was constructing difference of abstraction (46977states) and FLOYD_HOARE automaton (currently 19 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (6965 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. TIMEOUT Result, 202.3s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 187.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5365 SDtfs, 27167 SDslu, 1633 SDs, 0 SdLazy, 46255 SolverSat, 7265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 93.8s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1039 GetRequests, 940 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46977occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.6s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9978979217073385 AbsIntWeakeningRatio, 0.08393782383419689 AbsIntAvgWeakeningVarsNumRemoved, 19.10259067357513 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 590 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2077 NumberOfCodeBlocks, 2077 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2068 ConstructedInterpolants, 0 QuantifiedInterpolants, 1729732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 881/1178 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown