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-EXP.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:26:39,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:26:39,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:26:39,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:26:39,373 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:26:39,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:26:39,375 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:26:39,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:26:39,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:26:39,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:26:39,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:26:39,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:26:39,382 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:26:39,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:26:39,385 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:26:39,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:26:39,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:26:39,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:26:39,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:26:39,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:26:39,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:26:39,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:26:39,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:26:39,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:26:39,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:26:39,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:26:39,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:26:39,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:26:39,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:26:39,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:26:39,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:26:39,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:26:39,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:26:39,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:26:39,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:26:39,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:26:39,407 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:26:39,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:26:39,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:26:39,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:26:39,426 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:26:39,426 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:26:39,426 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:26:39,426 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:26:39,426 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:26:39,427 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:26:39,427 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:26:39,427 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:26:39,427 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:26:39,427 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:26:39,428 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:26:39,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:26:39,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:26:39,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:26:39,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:26:39,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:26:39,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:26:39,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:26:39,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:26:39,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:26:39,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:26:39,433 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:26:39,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:26:39,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:26:39,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:26:39,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:26:39,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:26:39,434 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:26:39,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:26:39,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:26:39,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:26:39,435 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:26:39,435 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:26:39,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:26:39,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:26:39,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:26:39,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:26:39,510 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:26:39,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-07 10:26:39,569 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9049164/c34e7e6f65604b75aa507c91c20d97a7/FLAG5815b527c [2018-11-07 10:26:40,114 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:26:40,114 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-07 10:26:40,122 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9049164/c34e7e6f65604b75aa507c91c20d97a7/FLAG5815b527c [2018-11-07 10:26:40,136 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9049164/c34e7e6f65604b75aa507c91c20d97a7 [2018-11-07 10:26:40,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:26:40,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:26:40,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:26:40,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:26:40,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:26:40,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2311bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40, skipping insertion in model container [2018-11-07 10:26:40,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:26:40,209 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:26:40,443 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:26:40,462 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:26:40,494 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:26:40,522 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:26:40,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40 WrapperNode [2018-11-07 10:26:40,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:26:40,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:26:40,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:26:40,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:26:40,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:26:40,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:26:40,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:26:40,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:26:40,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (1/1) ... [2018-11-07 10:26:40,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:26:40,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:26:40,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:26:40,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:26:40,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (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 10:26:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-07 10:26:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:26:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:26:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-07 10:26:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-07 10:26:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:26:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:26:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:26:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:26:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:26:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:26:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:26:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:26:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:26:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:26:41,292 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:26:41,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:26:41 BoogieIcfgContainer [2018-11-07 10:26:41,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:26:41,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:26:41,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:26:41,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:26:41,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:26:40" (1/3) ... [2018-11-07 10:26:41,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95f871f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:26:41, skipping insertion in model container [2018-11-07 10:26:41,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:40" (2/3) ... [2018-11-07 10:26:41,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95f871f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:26:41, skipping insertion in model container [2018-11-07 10:26:41,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:26:41" (3/3) ... [2018-11-07 10:26:41,302 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-07 10:26:41,313 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:26:41,321 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:26:41,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:26:41,376 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:26:41,377 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:26:41,377 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:26:41,377 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:26:41,377 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:26:41,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:26:41,378 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:26:41,378 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:26:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-11-07 10:26:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 10:26:41,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:41,410 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] [2018-11-07 10:26:41,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:41,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1753753572, now seen corresponding path program 1 times [2018-11-07 10:26:41,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:41,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:41,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:41,591 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 10:26:41,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:41,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:26:41,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:41,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:26:41,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:26:41,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:26:41,619 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 2 states. [2018-11-07 10:26:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:41,658 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-07 10:26:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:26:41,660 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-07 10:26:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:41,671 INFO L225 Difference]: With dead ends: 129 [2018-11-07 10:26:41,672 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 10:26:41,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:26:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 10:26:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-07 10:26:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 10:26:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-07 10:26:41,731 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 30 [2018-11-07 10:26:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:41,732 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-07 10:26:41,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:26:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-07 10:26:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 10:26:41,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:41,734 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] [2018-11-07 10:26:41,735 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:41,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -994182494, now seen corresponding path program 1 times [2018-11-07 10:26:41,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:41,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:41,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:41,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:41,894 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 10:26:41,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:41,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:26:41,894 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:41,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:26:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:26:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:26:41,898 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 3 states. [2018-11-07 10:26:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:42,017 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-11-07 10:26:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:26:42,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-07 10:26:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:42,021 INFO L225 Difference]: With dead ends: 100 [2018-11-07 10:26:42,021 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 10:26:42,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:26:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 10:26:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-07 10:26:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 10:26:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-11-07 10:26:42,038 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 37 [2018-11-07 10:26:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:42,040 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-07 10:26:42,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:26:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-07 10:26:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:26:42,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:42,042 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] [2018-11-07 10:26:42,042 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:42,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1887433787, now seen corresponding path program 1 times [2018-11-07 10:26:42,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:42,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:42,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:42,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:42,198 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 10:26:42,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:42,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:26:42,199 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:42,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:26:42,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:26:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:26:42,200 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 3 states. [2018-11-07 10:26:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:42,264 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2018-11-07 10:26:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:26:42,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-07 10:26:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:42,267 INFO L225 Difference]: With dead ends: 102 [2018-11-07 10:26:42,267 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 10:26:42,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:26:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 10:26:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-07 10:26:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 10:26:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-07 10:26:42,276 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 39 [2018-11-07 10:26:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:42,276 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-07 10:26:42,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:26:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-07 10:26:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:26:42,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:42,278 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] [2018-11-07 10:26:42,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:42,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1598186883, now seen corresponding path program 1 times [2018-11-07 10:26:42,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:42,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:42,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:42,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:42,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:42,609 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 10:26:42,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:42,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:26:42,610 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:42,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:26:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:26:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:26:42,611 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 6 states. [2018-11-07 10:26:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:42,984 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2018-11-07 10:26:42,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:26:42,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-07 10:26:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:42,988 INFO L225 Difference]: With dead ends: 176 [2018-11-07 10:26:42,989 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 10:26:42,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:26:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 10:26:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-11-07 10:26:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 10:26:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-07 10:26:43,006 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 39 [2018-11-07 10:26:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:43,006 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-07 10:26:43,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:26:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-07 10:26:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:26:43,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:43,008 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] [2018-11-07 10:26:43,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:43,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash 577118529, now seen corresponding path program 1 times [2018-11-07 10:26:43,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:43,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:43,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:43,147 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 10:26:43,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:43,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:26:43,148 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:43,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:26:43,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:26:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:26:43,150 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 5 states. [2018-11-07 10:26:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:43,447 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2018-11-07 10:26:43,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:26:43,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-07 10:26:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:43,450 INFO L225 Difference]: With dead ends: 156 [2018-11-07 10:26:43,450 INFO L226 Difference]: Without dead ends: 83 [2018-11-07 10:26:43,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:26:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-07 10:26:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2018-11-07 10:26:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 10:26:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-11-07 10:26:43,459 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 39 [2018-11-07 10:26:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:43,459 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-07 10:26:43,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:26:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-07 10:26:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 10:26:43,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:43,461 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 10:26:43,461 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:43,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2010865806, now seen corresponding path program 1 times [2018-11-07 10:26:43,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:43,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:43,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:43,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:26:43,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:43,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:26:43,679 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:43,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:26:43,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:26:43,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:26:43,681 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 7 states. [2018-11-07 10:26:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:44,569 INFO L93 Difference]: Finished difference Result 197 states and 239 transitions. [2018-11-07 10:26:44,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:26:44,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-07 10:26:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:44,572 INFO L225 Difference]: With dead ends: 197 [2018-11-07 10:26:44,573 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 10:26:44,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:26:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 10:26:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2018-11-07 10:26:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-07 10:26:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-11-07 10:26:44,585 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 46 [2018-11-07 10:26:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:44,586 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-11-07 10:26:44,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:26:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-11-07 10:26:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 10:26:44,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:44,590 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 10:26:44,590 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:44,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash 989797452, now seen corresponding path program 1 times [2018-11-07 10:26:44,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:44,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:44,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:44,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:44,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:26:44,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:44,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 10:26:44,838 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:44,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:26:44,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:26:44,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:26:44,840 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2018-11-07 10:26:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:45,055 INFO L93 Difference]: Finished difference Result 150 states and 179 transitions. [2018-11-07 10:26:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:26:45,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-07 10:26:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:45,056 INFO L225 Difference]: With dead ends: 150 [2018-11-07 10:26:45,057 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 10:26:45,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:26:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 10:26:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2018-11-07 10:26:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-07 10:26:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2018-11-07 10:26:45,072 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 46 [2018-11-07 10:26:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:45,073 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2018-11-07 10:26:45,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:26:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2018-11-07 10:26:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 10:26:45,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:45,075 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 10:26:45,075 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:45,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1585280596, now seen corresponding path program 1 times [2018-11-07 10:26:45,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:45,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:45,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:45,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:45,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:26:45,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:45,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:26:45,268 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:45,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:26:45,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:26:45,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:26:45,270 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand 4 states. [2018-11-07 10:26:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:45,603 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-11-07 10:26:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:26:45,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-07 10:26:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:45,613 INFO L225 Difference]: With dead ends: 201 [2018-11-07 10:26:45,613 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 10:26:45,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:26:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 10:26:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-11-07 10:26:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 10:26:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2018-11-07 10:26:45,641 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 50 [2018-11-07 10:26:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:45,642 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2018-11-07 10:26:45,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:26:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2018-11-07 10:26:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 10:26:45,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:45,644 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 10:26:45,644 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:45,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1745750679, now seen corresponding path program 1 times [2018-11-07 10:26:45,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:45,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:45,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:45,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:45,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:26:45,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:45,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:26:45,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:45,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:26:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:26:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:26:45,922 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 5 states. [2018-11-07 10:26:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:46,054 INFO L93 Difference]: Finished difference Result 238 states and 285 transitions. [2018-11-07 10:26:46,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:26:46,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-07 10:26:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:46,056 INFO L225 Difference]: With dead ends: 238 [2018-11-07 10:26:46,056 INFO L226 Difference]: Without dead ends: 181 [2018-11-07 10:26:46,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:26:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-07 10:26:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 147. [2018-11-07 10:26:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 10:26:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2018-11-07 10:26:46,069 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 52 [2018-11-07 10:26:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:46,069 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2018-11-07 10:26:46,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:26:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2018-11-07 10:26:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 10:26:46,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:46,071 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:46,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:46,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash 654175350, now seen corresponding path program 1 times [2018-11-07 10:26:46,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:46,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:46,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:46,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:46,313 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:46,314 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-11-07 10:26:46,316 INFO L202 CegarAbsIntRunner]: [0], [1], [7], [11], [12], [13], [16], [20], [22], [23], [28], [29], [30], [34], [40], [43], [47], [51], [53], [56], [57], [58], [63], [64], [65], [67], [73], [79], [82], [83], [84], [90], [96], [97], [98], [107], [109], [111], [116], [124], [125], [129], [130], [136], [139], [141], [147], [149], [150], [151], [153] [2018-11-07 10:26:46,352 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:26:46,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:26:46,696 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:26:46,698 INFO L272 AbstractInterpreter]: Visited 51 different actions 93 times. Merged at 20 different actions 40 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 37 variables. [2018-11-07 10:26:46,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:46,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:26:46,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:46,730 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 10:26:46,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:46,742 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:26:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:46,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:46,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:46,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:46,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2018-11-07 10:26:46,978 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:46,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:26:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:26:46,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:26:46,979 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand 8 states. [2018-11-07 10:26:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:47,319 INFO L93 Difference]: Finished difference Result 310 states and 372 transitions. [2018-11-07 10:26:47,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:26:47,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-07 10:26:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:47,321 INFO L225 Difference]: With dead ends: 310 [2018-11-07 10:26:47,321 INFO L226 Difference]: Without dead ends: 192 [2018-11-07 10:26:47,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:26:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-07 10:26:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 153. [2018-11-07 10:26:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 10:26:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2018-11-07 10:26:47,332 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 54 [2018-11-07 10:26:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:47,332 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2018-11-07 10:26:47,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:26:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2018-11-07 10:26:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 10:26:47,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:47,334 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:47,335 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:47,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:47,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2127291893, now seen corresponding path program 2 times [2018-11-07 10:26:47,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:47,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:47,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:47,337 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:47,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:47,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:47,564 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:47,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:47,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:47,565 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:47,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:26:47,574 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:26:47,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:26:47,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:26:47,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:48,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:48,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:48,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2018-11-07 10:26:48,302 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:48,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:26:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:26:48,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:26:48,303 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 16 states. [2018-11-07 10:26:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:48,973 INFO L93 Difference]: Finished difference Result 337 states and 395 transitions. [2018-11-07 10:26:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:26:48,973 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-07 10:26:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:48,977 INFO L225 Difference]: With dead ends: 337 [2018-11-07 10:26:48,977 INFO L226 Difference]: Without dead ends: 258 [2018-11-07 10:26:48,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:26:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-07 10:26:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 199. [2018-11-07 10:26:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 10:26:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2018-11-07 10:26:48,990 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 61 [2018-11-07 10:26:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:48,990 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2018-11-07 10:26:48,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:26:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-11-07 10:26:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 10:26:48,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:48,992 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:48,993 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:48,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1358328777, now seen corresponding path program 1 times [2018-11-07 10:26:48,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:48,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:48,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:26:48,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:48,995 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:49,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:49,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:49,249 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-07 10:26:49,249 INFO L202 CegarAbsIntRunner]: [0], [1], [7], [11], [12], [13], [16], [20], [22], [23], [28], [29], [30], [34], [40], [43], [47], [51], [53], [56], [57], [58], [63], [64], [65], [67], [73], [79], [82], [83], [84], [92], [96], [97], [98], [107], [109], [111], [116], [124], [125], [129], [130], [136], [139], [141], [147], [149], [150], [151], [153] [2018-11-07 10:26:49,253 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:26:49,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:26:49,376 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:26:49,376 INFO L272 AbstractInterpreter]: Visited 51 different actions 93 times. Merged at 20 different actions 40 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-07 10:26:49,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:49,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:26:49,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:49,401 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:49,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:49,421 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:26:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:49,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:49,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:50,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:50,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 21 [2018-11-07 10:26:50,100 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:50,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:26:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:26:50,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:26:50,102 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand 16 states. [2018-11-07 10:26:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:50,978 INFO L93 Difference]: Finished difference Result 267 states and 307 transitions. [2018-11-07 10:26:50,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:26:50,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-07 10:26:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:50,989 INFO L225 Difference]: With dead ends: 267 [2018-11-07 10:26:50,989 INFO L226 Difference]: Without dead ends: 265 [2018-11-07 10:26:50,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-11-07 10:26:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-07 10:26:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 197. [2018-11-07 10:26:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-07 10:26:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2018-11-07 10:26:51,001 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 61 [2018-11-07 10:26:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:51,001 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2018-11-07 10:26:51,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:26:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2018-11-07 10:26:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 10:26:51,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:51,003 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:51,003 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:51,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2033661897, now seen corresponding path program 1 times [2018-11-07 10:26:51,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:51,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:51,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:51,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:51,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:51,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:51,345 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-07 10:26:51,345 INFO L202 CegarAbsIntRunner]: [0], [1], [7], [11], [12], [13], [16], [20], [22], [23], [28], [29], [30], [34], [40], [45], [47], [51], [53], [56], [57], [58], [63], [64], [65], [67], [73], [79], [82], [83], [84], [90], [96], [97], [98], [107], [109], [111], [116], [124], [125], [129], [130], [136], [139], [141], [147], [149], [150], [151], [153] [2018-11-07 10:26:51,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:26:51,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:26:51,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:26:51,473 INFO L272 AbstractInterpreter]: Visited 51 different actions 93 times. Merged at 20 different actions 40 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-07 10:26:51,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:51,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:26:51,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:51,506 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:51,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:51,518 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:26:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:51,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:51,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:52,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:52,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2018-11-07 10:26:52,130 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:52,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 10:26:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 10:26:52,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:26:52,131 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand 16 states. [2018-11-07 10:26:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:53,181 INFO L93 Difference]: Finished difference Result 298 states and 346 transitions. [2018-11-07 10:26:53,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:26:53,182 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-07 10:26:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:53,185 INFO L225 Difference]: With dead ends: 298 [2018-11-07 10:26:53,185 INFO L226 Difference]: Without dead ends: 296 [2018-11-07 10:26:53,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:26:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-07 10:26:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 227. [2018-11-07 10:26:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-07 10:26:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 266 transitions. [2018-11-07 10:26:53,197 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 266 transitions. Word has length 61 [2018-11-07 10:26:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:53,197 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 266 transitions. [2018-11-07 10:26:53,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 10:26:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 266 transitions. [2018-11-07 10:26:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 10:26:53,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:53,199 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:53,199 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:53,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1224315271, now seen corresponding path program 1 times [2018-11-07 10:26:53,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:53,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:53,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:53,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:53,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 10:26:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 10:26:53,249 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 10:26:53,307 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,312 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,313 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,314 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,314 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,317 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,318 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,321 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,321 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,322 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,322 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,323 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,323 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,324 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,324 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,325 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,325 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,332 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,332 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-07 10:26:53,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:26:53 BoogieIcfgContainer [2018-11-07 10:26:53,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:26:53,347 INFO L168 Benchmark]: Toolchain (without parser) took 13198.26 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 882.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.5 MB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. [2018-11-07 10:26:53,349 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:26:53,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:26:53,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:26:53,351 INFO L168 Benchmark]: Boogie Preprocessor took 40.60 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:26:53,352 INFO L168 Benchmark]: RCFGBuilder took 700.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-07 10:26:53,353 INFO L168 Benchmark]: TraceAbstraction took 12052.15 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 12.1 MB). Peak memory consumption was 143.1 MB. Max. memory is 7.1 GB. [2018-11-07 10:26:53,358 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 371.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.60 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 700.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12052.15 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 12.1 MB). Peak memory consumption was 143.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L75] FCALL char A [2 + 2 + 4 +1]; VAL [A={38:0}] [L76] FCALL A[2 + 2 + 4] = 0 VAL [A={38:0}] [L77] CALL parse_expression_list (A) VAL [str={38:0}] [L49] int start=0, i=-1, j=-1; VAL [i=-1, j=-1, start=0, str={38:0}, str={38:0}] [L50] FCALL char str2[2]; VAL [i=-1, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}] [L51] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}] [L53] i++ VAL [i=0, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}] [L54] FCALL str[i] VAL [i=0, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=35] [L55] case 0: VAL [i=0, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=35] [L70] EXPR, FCALL str[i] VAL [i=0, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=35] [L70] COND TRUE str[i] != 0 [L53] i++ VAL [i=1, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}] [L54] FCALL str[i] VAL [i=1, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=39] [L55] case 0: VAL [i=1, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=39] [L70] EXPR, FCALL str[i] VAL [i=1, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=39] [L70] COND TRUE str[i] != 0 [L53] i++ VAL [i=2, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}] [L54] FCALL str[i] VAL [i=2, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0] [L55] case 0: VAL [i=2, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0] [L56] EXPR, FCALL str[start] VAL [i=2, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[start]=35] [L56] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[start]=35] [L56] EXPR, FCALL str[start] VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[start]=35, str[start]=35] [L56] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[start]=35, str[start]=35] [L56] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L57] EXPR, FCALL str[start] VAL [i=2, j=-1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[start]=35] [L57] COND FALSE !(str[start] == '"') [L58] j = i-1 VAL [i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0] [L59] EXPR, FCALL str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[j]=39] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[j]=39] [L59] EXPR, FCALL str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[j]=39, str[j]=39] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[j]=39, str[j]=39] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[j]=39, str[j]=39] [L59] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L60] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0] [L60] EXPR, FCALL str[j] VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[j]=39] [L60] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0, str[j]=39] [L60] COND FALSE !((0 < j) && (str[j] == '"')) [L61] COND TRUE start<=j VAL [i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0] [L62] FCALL r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, start=0, str={38:0}, str={38:0}, str2={37:0}, str[i]=0] [L63] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 71 locations, 1 error locations. UNSAFE Result, 11.9s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 897 SDtfs, 1623 SDslu, 3148 SDs, 0 SdLazy, 1625 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 449 SyntacticMatches, 13 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 373 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1068 ConstructedInterpolants, 0 QuantifiedInterpolants, 215276 SizeOfPredicates, 11 NumberOfNonLiveVariables, 537 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 16/163 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...