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.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 04:54:54,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:54:54,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:54:54,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:54:54,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:54:54,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:54:54,172 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:54:54,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:54:54,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:54:54,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:54:54,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:54:54,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:54:54,179 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:54:54,180 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:54:54,181 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:54:54,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:54:54,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:54:54,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:54:54,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:54:54,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:54:54,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:54:54,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:54:54,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:54:54,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:54:54,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:54:54,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:54:54,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:54:54,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:54:54,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:54:54,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:54:54,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:54:54,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:54:54,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:54:54,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:54:54,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:54:54,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:54:54,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:54:54,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:54:54,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:54:54,222 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:54:54,222 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:54:54,222 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:54:54,222 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:54:54,222 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:54:54,223 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:54:54,223 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:54:54,223 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:54:54,223 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:54:54,223 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:54:54,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:54:54,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:54:54,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:54:54,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:54:54,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:54:54,225 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:54:54,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:54:54,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:54:54,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:54:54,226 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:54:54,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:54:54,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:54:54,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:54:54,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:54:54,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:54:54,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:54:54,228 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:54:54,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:54:54,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:54:54,228 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:54:54,229 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:54:54,229 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:54:54,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:54:54,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:54:54,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:54:54,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:54:54,315 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:54:54,316 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 04:54:54,388 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91349e7d2/f47ef339621a4fd9876502e0aba33263/FLAG1a294bb91 [2018-11-07 04:54:54,927 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:54:54,928 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 04:54:54,937 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91349e7d2/f47ef339621a4fd9876502e0aba33263/FLAG1a294bb91 [2018-11-07 04:54:54,952 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91349e7d2/f47ef339621a4fd9876502e0aba33263 [2018-11-07 04:54:54,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:54:54,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:54:54,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:54:54,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:54:54,972 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:54:54,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:54:54" (1/1) ... [2018-11-07 04:54:54,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7a6e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:54, skipping insertion in model container [2018-11-07 04:54:54,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:54:54" (1/1) ... [2018-11-07 04:54:54,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:54:55,018 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:54:55,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:54:55,283 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:54:55,315 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:54:55,339 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:54:55,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55 WrapperNode [2018-11-07 04:54:55,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:54:55,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:54:55,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:54:55,342 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:54:55,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:54:55,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:54:55,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:54:55,372 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:54:55,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (1/1) ... [2018-11-07 04:54:55,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:54:55,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:54:55,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:54:55,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:54:55,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (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 04:54:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-07 04:54:55,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:54:55,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:54:55,582 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-07 04:54:55,582 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-07 04:54:55,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:54:55,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:54:55,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:54:55,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:54:55,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:54:55,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:54:55,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:54:55,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:54:55,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:54:55,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:54:56,172 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:54:56,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:56 BoogieIcfgContainer [2018-11-07 04:54:56,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:54:56,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:54:56,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:54:56,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:54:56,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:54:54" (1/3) ... [2018-11-07 04:54:56,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c59eb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:54:56, skipping insertion in model container [2018-11-07 04:54:56,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:55" (2/3) ... [2018-11-07 04:54:56,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c59eb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:54:56, skipping insertion in model container [2018-11-07 04:54:56,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:56" (3/3) ... [2018-11-07 04:54:56,182 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-07 04:54:56,192 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:54:56,200 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:54:56,217 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:54:56,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:54:56,255 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:54:56,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:54:56,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:54:56,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:54:56,256 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:54:56,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:54:56,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:54:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-11-07 04:54:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 04:54:56,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:56,287 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 04:54:56,290 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:56,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1753753572, now seen corresponding path program 1 times [2018-11-07 04:54:56,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:56,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:56,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:56,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:56,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:56,466 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 04:54:56,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:56,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:54:56,469 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:56,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:54:56,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:54:56,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:54:56,495 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 2 states. [2018-11-07 04:54:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:56,524 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-07 04:54:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:54:56,526 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-07 04:54:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:56,536 INFO L225 Difference]: With dead ends: 129 [2018-11-07 04:54:56,536 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 04:54:56,540 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 04:54:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 04:54:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-07 04:54:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 04:54:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-07 04:54:56,589 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 30 [2018-11-07 04:54:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:56,590 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-07 04:54:56,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:54:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-07 04:54:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 04:54:56,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:56,592 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 04:54:56,592 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:56,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash -994182494, now seen corresponding path program 1 times [2018-11-07 04:54:56,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:56,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:56,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:56,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:56,745 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 04:54:56,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:56,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:54:56,747 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:56,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:54:56,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:54:56,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:54:56,750 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 3 states. [2018-11-07 04:54:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:56,817 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-11-07 04:54:56,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:54:56,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-07 04:54:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:56,821 INFO L225 Difference]: With dead ends: 100 [2018-11-07 04:54:56,821 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 04:54:56,823 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 04:54:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 04:54:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-07 04:54:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 04:54:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-11-07 04:54:56,832 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 37 [2018-11-07 04:54:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:56,832 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-07 04:54:56,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:54:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-07 04:54:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 04:54:56,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:56,834 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 04:54:56,834 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:56,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1887433787, now seen corresponding path program 1 times [2018-11-07 04:54:56,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:56,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:56,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:56,922 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 04:54:56,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:56,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:54:56,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:56,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:54:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:54:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:54:56,924 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 3 states. [2018-11-07 04:54:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:57,013 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2018-11-07 04:54:57,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:54:57,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-07 04:54:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:57,015 INFO L225 Difference]: With dead ends: 102 [2018-11-07 04:54:57,016 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 04:54:57,016 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 04:54:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 04:54:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-07 04:54:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 04:54:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-07 04:54:57,024 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 39 [2018-11-07 04:54:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:57,024 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-07 04:54:57,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:54:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-07 04:54:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 04:54:57,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:57,026 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 04:54:57,027 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:57,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:57,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1598186883, now seen corresponding path program 1 times [2018-11-07 04:54:57,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:57,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:57,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:57,303 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 04:54:57,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:57,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 04:54:57,304 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:57,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:54:57,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:54:57,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:54:57,306 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 6 states. [2018-11-07 04:54:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:57,902 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2018-11-07 04:54:57,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:54:57,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-07 04:54:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:57,910 INFO L225 Difference]: With dead ends: 176 [2018-11-07 04:54:57,911 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 04:54:57,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:54:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 04:54:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-11-07 04:54:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 04:54:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-07 04:54:57,940 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 39 [2018-11-07 04:54:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:57,944 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-07 04:54:57,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:54:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-07 04:54:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 04:54:57,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:57,949 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 04:54:57,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:57,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 577118529, now seen corresponding path program 1 times [2018-11-07 04:54:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:57,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:57,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:58,086 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 04:54:58,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:58,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 04:54:58,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:58,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:54:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:54:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:54:58,089 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 5 states. [2018-11-07 04:54:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:58,427 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2018-11-07 04:54:58,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:54:58,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-07 04:54:58,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:58,430 INFO L225 Difference]: With dead ends: 156 [2018-11-07 04:54:58,431 INFO L226 Difference]: Without dead ends: 83 [2018-11-07 04:54:58,432 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 04:54:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-07 04:54:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2018-11-07 04:54:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 04:54:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-11-07 04:54:58,440 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 39 [2018-11-07 04:54:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:58,440 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-07 04:54:58,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:54:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-07 04:54:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 04:54:58,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:58,442 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 04:54:58,442 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:58,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2010865806, now seen corresponding path program 1 times [2018-11-07 04:54:58,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:58,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:58,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:58,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:58,819 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 04:54:58,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:58,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 04:54:58,820 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:58,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:54:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:54:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:54:58,822 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 7 states. [2018-11-07 04:54:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:59,304 INFO L93 Difference]: Finished difference Result 197 states and 239 transitions. [2018-11-07 04:54:59,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:54:59,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-07 04:54:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:59,308 INFO L225 Difference]: With dead ends: 197 [2018-11-07 04:54:59,308 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 04:54:59,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-07 04:54:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 04:54:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2018-11-07 04:54:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-07 04:54:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-11-07 04:54:59,321 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 46 [2018-11-07 04:54:59,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:59,321 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-11-07 04:54:59,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:54:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-11-07 04:54:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 04:54:59,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:59,323 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 04:54:59,323 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:59,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:59,324 INFO L82 PathProgramCache]: Analyzing trace with hash 989797452, now seen corresponding path program 1 times [2018-11-07 04:54:59,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:59,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:59,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:59,492 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 04:54:59,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:59,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 04:54:59,493 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:59,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:54:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:54:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:54:59,494 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2018-11-07 04:54:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:59,679 INFO L93 Difference]: Finished difference Result 150 states and 179 transitions. [2018-11-07 04:54:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:54:59,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-07 04:54:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:59,681 INFO L225 Difference]: With dead ends: 150 [2018-11-07 04:54:59,682 INFO L226 Difference]: Without dead ends: 148 [2018-11-07 04:54:59,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:54:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-07 04:54:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2018-11-07 04:54:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-07 04:54:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2018-11-07 04:54:59,695 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 46 [2018-11-07 04:54:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:59,695 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2018-11-07 04:54:59,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:54:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2018-11-07 04:54:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 04:54:59,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:59,697 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 04:54:59,698 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:59,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1585280596, now seen corresponding path program 1 times [2018-11-07 04:54:59,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:59,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:59,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:59,757 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 04:54:59,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:59,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 04:54:59,758 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:59,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:54:59,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:54:59,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 04:54:59,759 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand 4 states. [2018-11-07 04:54:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:59,811 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-11-07 04:54:59,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:54:59,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-07 04:54:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:59,814 INFO L225 Difference]: With dead ends: 201 [2018-11-07 04:54:59,815 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 04:54:59,816 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:54:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 04:54:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-11-07 04:54:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-07 04:54:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2018-11-07 04:54:59,826 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 50 [2018-11-07 04:54:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:59,826 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2018-11-07 04:54:59,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:54:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2018-11-07 04:54:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 04:54:59,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:59,829 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 04:54:59,829 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:59,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1745750679, now seen corresponding path program 1 times [2018-11-07 04:54:59,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:59,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:59,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:59,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:59,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:59,902 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 04:54:59,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:59,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 04:54:59,903 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:59,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:54:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:54:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:54:59,904 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 5 states. [2018-11-07 04:55:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:00,038 INFO L93 Difference]: Finished difference Result 238 states and 285 transitions. [2018-11-07 04:55:00,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:55:00,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-07 04:55:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:00,040 INFO L225 Difference]: With dead ends: 238 [2018-11-07 04:55:00,040 INFO L226 Difference]: Without dead ends: 181 [2018-11-07 04:55:00,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:55:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-07 04:55:00,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 147. [2018-11-07 04:55:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 04:55:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2018-11-07 04:55:00,055 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 52 [2018-11-07 04:55:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:00,055 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2018-11-07 04:55:00,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:55:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2018-11-07 04:55:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 04:55:00,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:00,057 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 04:55:00,058 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:00,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash 654175350, now seen corresponding path program 1 times [2018-11-07 04:55:00,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:00,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:00,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:00,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:00,213 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 04:55:00,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:00,214 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:00,215 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-11-07 04:55:00,217 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 04:55:00,276 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:00,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:03,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:55:03,645 INFO L272 AbstractInterpreter]: Visited 51 different actions 974 times. Merged at 36 different actions 836 times. Widened at 3 different actions 61 times. Found 2 fixpoints after 2 different actions. Largest state had 37 variables. [2018-11-07 04:55:03,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:03,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:55:03,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:03,684 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 04:55:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:03,706 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:03,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:03,846 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 04:55:03,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:03,942 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 04:55:03,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:03,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2018-11-07 04:55:03,964 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:03,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:55:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:55:03,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:55:03,965 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand 8 states. [2018-11-07 04:55:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:04,369 INFO L93 Difference]: Finished difference Result 310 states and 372 transitions. [2018-11-07 04:55:04,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:55:04,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-07 04:55:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:04,372 INFO L225 Difference]: With dead ends: 310 [2018-11-07 04:55:04,372 INFO L226 Difference]: Without dead ends: 192 [2018-11-07 04:55:04,374 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 04:55:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-07 04:55:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 153. [2018-11-07 04:55:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 04:55:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2018-11-07 04:55:04,388 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 54 [2018-11-07 04:55:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:04,388 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2018-11-07 04:55:04,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:55:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2018-11-07 04:55:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 04:55:04,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:04,391 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 04:55:04,392 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:04,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2127291893, now seen corresponding path program 2 times [2018-11-07 04:55:04,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:04,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:04,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:04,581 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 04:55:04,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:04,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:04,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:04,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:04,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:04,582 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 04:55:04,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:04,591 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:04,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:55:04,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:04,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:04,973 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 04:55:04,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:05,168 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 04:55:05,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:05,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2018-11-07 04:55:05,191 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:05,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 04:55:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 04:55:05,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:55:05,192 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 16 states. [2018-11-07 04:55:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:05,803 INFO L93 Difference]: Finished difference Result 337 states and 395 transitions. [2018-11-07 04:55:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 04:55:05,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-07 04:55:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:05,806 INFO L225 Difference]: With dead ends: 337 [2018-11-07 04:55:05,806 INFO L226 Difference]: Without dead ends: 258 [2018-11-07 04:55:05,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2018-11-07 04:55:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-07 04:55:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 199. [2018-11-07 04:55:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 04:55:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2018-11-07 04:55:05,817 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 61 [2018-11-07 04:55:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:05,818 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2018-11-07 04:55:05,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 04:55:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-11-07 04:55:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 04:55:05,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:05,819 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 04:55:05,820 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:05,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1358328777, now seen corresponding path program 1 times [2018-11-07 04:55:05,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:05,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:05,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:05,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:05,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:05,976 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 04:55:05,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:05,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:05,977 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-07 04:55:05,977 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 04:55:05,981 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:05,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:08,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:55:08,421 INFO L272 AbstractInterpreter]: Visited 51 different actions 980 times. Merged at 36 different actions 839 times. Widened at 3 different actions 61 times. Found 2 fixpoints after 2 different actions. Largest state had 36 variables. [2018-11-07 04:55:08,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:08,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:55:08,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:08,461 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 04:55:08,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:08,474 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:08,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:08,845 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 04:55:08,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:08,977 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 04:55:08,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:08,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 21 [2018-11-07 04:55:08,999 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:09,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 04:55:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 04:55:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:55:09,000 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand 16 states. [2018-11-07 04:55:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:09,827 INFO L93 Difference]: Finished difference Result 267 states and 307 transitions. [2018-11-07 04:55:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 04:55:09,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-07 04:55:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:09,831 INFO L225 Difference]: With dead ends: 267 [2018-11-07 04:55:09,831 INFO L226 Difference]: Without dead ends: 265 [2018-11-07 04:55:09,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-11-07 04:55:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-07 04:55:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 197. [2018-11-07 04:55:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-07 04:55:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2018-11-07 04:55:09,841 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 61 [2018-11-07 04:55:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:09,841 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2018-11-07 04:55:09,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 04:55:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2018-11-07 04:55:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 04:55:09,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:09,843 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 04:55:09,843 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:09,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2033661897, now seen corresponding path program 1 times [2018-11-07 04:55:09,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:09,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:09,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:09,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:09,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:10,139 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 04:55:10,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:10,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:10,140 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-07 04:55:10,140 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 04:55:10,142 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:10,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:11,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:55:11,762 INFO L272 AbstractInterpreter]: Visited 51 different actions 892 times. Merged at 36 different actions 763 times. Widened at 3 different actions 57 times. Found 6 fixpoints after 3 different actions. Largest state had 36 variables. [2018-11-07 04:55:11,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:11,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:55:11,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:11,800 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 04:55:11,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:11,812 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:11,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:13,647 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 04:55:13,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:15,111 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 04:55:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2018-11-07 04:55:15,134 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:15,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 04:55:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 04:55:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2018-11-07 04:55:15,136 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand 16 states. [2018-11-07 04:55:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:15,814 INFO L93 Difference]: Finished difference Result 298 states and 346 transitions. [2018-11-07 04:55:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 04:55:15,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-07 04:55:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:15,819 INFO L225 Difference]: With dead ends: 298 [2018-11-07 04:55:15,820 INFO L226 Difference]: Without dead ends: 296 [2018-11-07 04:55:15,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-11-07 04:55:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-07 04:55:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 227. [2018-11-07 04:55:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-07 04:55:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 266 transitions. [2018-11-07 04:55:15,833 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 266 transitions. Word has length 61 [2018-11-07 04:55:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:15,833 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 266 transitions. [2018-11-07 04:55:15,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 04:55:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 266 transitions. [2018-11-07 04:55:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 04:55:15,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:15,834 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 04:55:15,836 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:15,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1224315271, now seen corresponding path program 1 times [2018-11-07 04:55:15,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:15,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 04:55:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 04:55:15,908 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 04:55:15,967 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 04:55:15,971 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 04:55:15,978 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 04:55:15,978 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 04:55:15,979 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 04:55:15,979 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 04:55:15,980 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 04:55:15,980 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 04:55:15,986 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 04:55:15,989 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 04:55:15,989 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 04:55:15,990 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 04:55:15,990 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 04:55:15,991 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 04:55:15,991 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 04:55:15,991 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 04:55:15,992 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 04:55:15,992 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 04:55:15,993 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 04:55:15,993 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 04:55:16,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:55:16 BoogieIcfgContainer [2018-11-07 04:55:16,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:55:16,013 INFO L168 Benchmark]: Toolchain (without parser) took 21047.35 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -522.6 MB). Peak memory consumption was 763.5 MB. Max. memory is 7.1 GB. [2018-11-07 04:55:16,015 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:55:16,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.08 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 04:55:16,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.47 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 04:55:16,017 INFO L168 Benchmark]: Boogie Preprocessor took 58.55 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 04:55:16,017 INFO L168 Benchmark]: RCFGBuilder took 740.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-07 04:55:16,018 INFO L168 Benchmark]: TraceAbstraction took 19838.07 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 531.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 251.5 MB). Peak memory consumption was 783.2 MB. Max. memory is 7.1 GB. [2018-11-07 04:55:16,022 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.08 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 30.47 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 58.55 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. * RCFGBuilder took 740.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19838.07 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 531.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 251.5 MB). Peak memory consumption was 783.2 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, 19.7s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 4.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.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 449 SyntacticMatches, 13 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 6.2s 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, 7.6s 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.3s SatisfiabilityAnalysisTime, 6.2s 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...