java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/aiob_4_true-unreach-call.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:48:10,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:48:10,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:48:10,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:48:10,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:48:10,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:48:10,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:48:10,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:48:10,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:48:10,399 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:48:10,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:48:10,401 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:48:10,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:48:10,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:48:10,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:48:10,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:48:10,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:48:10,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:48:10,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:48:10,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:48:10,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:48:10,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:48:10,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:48:10,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:48:10,416 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:48:10,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:48:10,418 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:48:10,419 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:48:10,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:48:10,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:48:10,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:48:10,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:48:10,422 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:48:10,422 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:48:10,423 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:48:10,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:48:10,424 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:48:10,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:48:10,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:48:10,456 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:48:10,456 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:48:10,456 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:48:10,456 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:48:10,457 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:48:10,457 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:48:10,457 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:48:10,457 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:48:10,457 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:48:10,458 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:48:10,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:48:10,459 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:48:10,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:48:10,459 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:48:10,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:48:10,460 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:48:10,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:48:10,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:48:10,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:48:10,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:48:10,463 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:48:10,463 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:48:10,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:48:10,463 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:48:10,463 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:48:10,464 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:48:10,464 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:48:10,464 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:48:10,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:48:10,464 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:48:10,464 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:48:10,465 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:48:10,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:48:10,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:48:10,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:48:10,551 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:48:10,552 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:48:10,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/aiob_4_true-unreach-call.c.v+lhb-reducer.c [2018-11-07 16:48:10,624 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9a2da4f/e5f0464694a64e668eb2c598e8ab31cd/FLAGde6bbe259 [2018-11-07 16:48:11,150 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:48:11,154 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/aiob_4_true-unreach-call.c.v+lhb-reducer.c [2018-11-07 16:48:11,164 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9a2da4f/e5f0464694a64e668eb2c598e8ab31cd/FLAGde6bbe259 [2018-11-07 16:48:11,178 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9a2da4f/e5f0464694a64e668eb2c598e8ab31cd [2018-11-07 16:48:11,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:48:11,191 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:48:11,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:48:11,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:48:11,196 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:48:11,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:11,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbe1590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11, skipping insertion in model container [2018-11-07 16:48:11,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:11,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:48:11,281 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:48:11,688 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:48:11,701 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:48:11,818 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:48:11,925 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:48:11,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11 WrapperNode [2018-11-07 16:48:11,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:48:11,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:48:11,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:48:11,927 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:48:11,935 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:48:11" (1/1) ... [2018-11-07 16:48:11,955 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:48:11" (1/1) ... [2018-11-07 16:48:11,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:48:11,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:48:11,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:48:11,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:48:11,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:11,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:11,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:11,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:12,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:12,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:12,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (1/1) ... [2018-11-07 16:48:12,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:48:12,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:48:12,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:48:12,089 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:48:12,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (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 16:48:12,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-07 16:48:12,186 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2018-11-07 16:48:12,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:48:12,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:48:12,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-07 16:48:12,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:48:12,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:48:12,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 16:48:12,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:48:12,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:48:12,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 16:48:12,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 16:48:15,106 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:48:15,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:48:15 BoogieIcfgContainer [2018-11-07 16:48:15,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:48:15,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:48:15,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:48:15,112 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:48:15,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:48:11" (1/3) ... [2018-11-07 16:48:15,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f749c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:48:15, skipping insertion in model container [2018-11-07 16:48:15,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:11" (2/3) ... [2018-11-07 16:48:15,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f749c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:48:15, skipping insertion in model container [2018-11-07 16:48:15,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:48:15" (3/3) ... [2018-11-07 16:48:15,116 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4_true-unreach-call.c.v+lhb-reducer.c [2018-11-07 16:48:15,124 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:48:15,132 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:48:15,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:48:15,189 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:48:15,190 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:48:15,190 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:48:15,190 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:48:15,190 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:48:15,192 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:48:15,192 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:48:15,192 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:48:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states. [2018-11-07 16:48:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-07 16:48:15,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:15,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:15,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:15,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:15,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1955952489, now seen corresponding path program 1 times [2018-11-07 16:48:15,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:15,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:15,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:15,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:15,316 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:17,444 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 16:48:17,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:48:17,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-07 16:48:17,447 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:48:17,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:48:17,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:48:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:48:17,474 INFO L87 Difference]: Start difference. First operand 460 states. Second operand 19 states. [2018-11-07 16:48:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:20,144 INFO L93 Difference]: Finished difference Result 512 states and 555 transitions. [2018-11-07 16:48:20,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:48:20,148 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 286 [2018-11-07 16:48:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:20,164 INFO L225 Difference]: With dead ends: 512 [2018-11-07 16:48:20,164 INFO L226 Difference]: Without dead ends: 297 [2018-11-07 16:48:20,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:48:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-07 16:48:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2018-11-07 16:48:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-07 16:48:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-11-07 16:48:20,237 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 286 [2018-11-07 16:48:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:20,239 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-11-07 16:48:20,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:48:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-11-07 16:48:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-07 16:48:20,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:20,247 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:20,248 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:20,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:20,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1437647447, now seen corresponding path program 1 times [2018-11-07 16:48:20,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:20,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:20,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:22,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:22,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:22,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-11-07 16:48:22,058 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [20], [21], [22], [23], [24], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [127], [128], [129], [130], [131], [132], [133], [134], [135], [136], [137], [138], [139], [140], [141], [142], [143], [144], [145], [146], [147], [148], [149], [150], [151], [152], [153], [154], [155], [156], [157], [158], [159], [160], [161], [162], [163], [164], [165], [166], [167], [168], [169], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182], [183], [184], [185], [186], [187], [188], [189], [190], [191], [192], [193], [194], [195], [196], [197], [198], [199], [200], [201], [202], [203], [204], [205], [206], [207], [208], [209], [210], [211], [212], [213], [214], [215], [216], [217], [218], [219], [220], [221], [222], [223], [224], [225], [226], [227], [228], [229], [230], [231], [232], [233], [234], [235], [236], [237], [238], [239], [240], [243], [246], [254], [255], [258], [261], [264], [272], [273], [276], [279], [282], [290], [291], [294], [297], [300], [308], [309], [312], [315], [318], [326], [327], [330], [333], [336], [344], [345], [348], [351], [354], [362], [363], [366], [369], [372], [380], [381], [384], [387], [390], [398], [399], [402], [404], [407], [410], [418], [419], [422], [429], [432], [433], [585], [586], [587] [2018-11-07 16:48:22,106 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:48:22,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:48:22,903 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:48:24,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:48:24,324 INFO L272 AbstractInterpreter]: Visited 290 different actions 512 times. Merged at 9 different actions 220 times. Widened at 1 different actions 22 times. Found 1 fixpoints after 1 different actions. Largest state had 306 variables. [2018-11-07 16:48:24,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:24,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:48:24,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:24,361 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 16:48:24,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:24,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:48:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:25,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:25,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:26,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:26,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 32 [2018-11-07 16:48:26,625 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:26,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:48:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:48:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:48:26,628 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 20 states. [2018-11-07 16:48:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:27,868 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-11-07 16:48:27,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:48:27,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 292 [2018-11-07 16:48:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:27,875 INFO L225 Difference]: With dead ends: 306 [2018-11-07 16:48:27,876 INFO L226 Difference]: Without dead ends: 303 [2018-11-07 16:48:27,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 571 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 16:48:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-07 16:48:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-11-07 16:48:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-07 16:48:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-11-07 16:48:27,902 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 292 [2018-11-07 16:48:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:27,903 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-11-07 16:48:27,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:48:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-11-07 16:48:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-07 16:48:27,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:27,909 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:27,910 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:27,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:27,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1907860165, now seen corresponding path program 2 times [2018-11-07 16:48:27,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:27,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:48:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:27,912 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:29,056 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-07 16:48:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:29,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:29,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:29,884 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:29,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:29,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:29,884 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 16:48:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:48:29,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:48:54,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:48:54,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:54,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:54,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:55,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:55,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 15] total 34 [2018-11-07 16:48:55,466 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:55,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:48:55,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:48:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:48:55,469 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 21 states. [2018-11-07 16:48:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:56,608 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2018-11-07 16:48:56,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:48:56,611 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 298 [2018-11-07 16:48:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:56,614 INFO L225 Difference]: With dead ends: 312 [2018-11-07 16:48:56,615 INFO L226 Difference]: Without dead ends: 309 [2018-11-07 16:48:56,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 582 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=425, Invalid=1297, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:48:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-07 16:48:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2018-11-07 16:48:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-07 16:48:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-11-07 16:48:56,631 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 298 [2018-11-07 16:48:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:56,632 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-11-07 16:48:56,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:48:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-11-07 16:48:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-07 16:48:56,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:56,637 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:56,637 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:56,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:56,638 INFO L82 PathProgramCache]: Analyzing trace with hash -537131187, now seen corresponding path program 3 times [2018-11-07 16:48:56,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:56,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:56,639 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:57,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:57,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:57,378 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:57,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:57,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:57,379 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 16:48:57,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:57,389 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:58,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:58,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:58,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:58,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:48:59,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:59,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 36 [2018-11-07 16:48:59,362 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:59,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:48:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:48:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=939, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:48:59,365 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 22 states. [2018-11-07 16:49:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:00,388 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-11-07 16:49:00,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:49:00,389 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 304 [2018-11-07 16:49:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:00,392 INFO L225 Difference]: With dead ends: 318 [2018-11-07 16:49:00,392 INFO L226 Difference]: Without dead ends: 315 [2018-11-07 16:49:00,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 593 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=485, Invalid=1495, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 16:49:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-07 16:49:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2018-11-07 16:49:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-07 16:49:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-11-07 16:49:00,405 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 304 [2018-11-07 16:49:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:00,406 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-11-07 16:49:00,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:49:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-11-07 16:49:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-11-07 16:49:00,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:00,409 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:49:00,409 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:00,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:00,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2063096799, now seen corresponding path program 4 times [2018-11-07 16:49:00,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:00,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:00,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:00,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:00,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:01,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:01,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:01,208 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:01,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:01,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:01,208 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 16:49:01,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:01,221 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:02,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:02,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:03,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 38 [2018-11-07 16:49:03,867 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:03,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:49:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:49:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1049, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:49:03,869 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 23 states. [2018-11-07 16:49:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:05,043 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-11-07 16:49:05,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:49:05,043 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 310 [2018-11-07 16:49:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:05,047 INFO L225 Difference]: With dead ends: 324 [2018-11-07 16:49:05,047 INFO L226 Difference]: Without dead ends: 321 [2018-11-07 16:49:05,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 604 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=549, Invalid=1707, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:49:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-07 16:49:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2018-11-07 16:49:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-07 16:49:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-11-07 16:49:05,058 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 310 [2018-11-07 16:49:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:05,059 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-11-07 16:49:05,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:49:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-11-07 16:49:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-07 16:49:05,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:05,061 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:49:05,062 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:05,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:05,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1615627535, now seen corresponding path program 5 times [2018-11-07 16:49:05,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:05,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:05,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:06,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:06,219 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:06,219 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:06,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:06,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:06,220 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:06,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:06,229 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:06,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:50:06,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:06,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:06,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:08,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:08,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 18] total 40 [2018-11-07 16:50:08,442 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:08,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:50:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:50:08,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:50:08,445 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 24 states. [2018-11-07 16:50:09,884 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 16:50:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:11,666 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-11-07 16:50:11,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:50:11,667 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 316 [2018-11-07 16:50:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:11,670 INFO L225 Difference]: With dead ends: 330 [2018-11-07 16:50:11,670 INFO L226 Difference]: Without dead ends: 327 [2018-11-07 16:50:11,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 615 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=617, Invalid=1933, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 16:50:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-07 16:50:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2018-11-07 16:50:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-07 16:50:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-11-07 16:50:11,681 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 316 [2018-11-07 16:50:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:11,682 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-11-07 16:50:11,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:50:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-11-07 16:50:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-11-07 16:50:11,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:11,684 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:11,684 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:11,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:11,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1517583229, now seen corresponding path program 6 times [2018-11-07 16:50:11,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:11,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:11,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:11,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:11,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:12,070 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-07 16:50:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:12,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:12,807 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:12,807 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:12,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:12,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:12,807 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:12,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:12,817 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:13,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:13,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:13,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:13,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:15,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:15,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19] total 42 [2018-11-07 16:50:15,102 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:15,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:50:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:50:15,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1287, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:50:15,105 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 25 states. [2018-11-07 16:50:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:16,559 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2018-11-07 16:50:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:50:16,564 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 322 [2018-11-07 16:50:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:16,567 INFO L225 Difference]: With dead ends: 336 [2018-11-07 16:50:16,567 INFO L226 Difference]: Without dead ends: 333 [2018-11-07 16:50:16,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 626 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=689, Invalid=2173, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:50:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-07 16:50:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2018-11-07 16:50:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-07 16:50:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-11-07 16:50:16,576 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 322 [2018-11-07 16:50:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:16,577 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-11-07 16:50:16,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:50:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-11-07 16:50:16,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-07 16:50:16,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:16,579 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:16,579 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:16,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:16,580 INFO L82 PathProgramCache]: Analyzing trace with hash 751212693, now seen corresponding path program 7 times [2018-11-07 16:50:16,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:16,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:16,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:16,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:16,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:17,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:17,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:17,222 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:17,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:17,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:17,223 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:17,231 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:19,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:19,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:21,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:21,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 20] total 44 [2018-11-07 16:50:21,991 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:21,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 16:50:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 16:50:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:50:21,993 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 26 states. [2018-11-07 16:50:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:23,708 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2018-11-07 16:50:23,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:50:23,709 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 328 [2018-11-07 16:50:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:23,712 INFO L225 Difference]: With dead ends: 342 [2018-11-07 16:50:23,713 INFO L226 Difference]: Without dead ends: 339 [2018-11-07 16:50:23,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 637 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=765, Invalid=2427, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 16:50:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-07 16:50:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-11-07 16:50:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-07 16:50:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-11-07 16:50:23,723 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 328 [2018-11-07 16:50:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:23,724 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-11-07 16:50:23,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 16:50:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-11-07 16:50:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-07 16:50:23,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:23,726 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:23,726 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:23,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash -795683033, now seen corresponding path program 8 times [2018-11-07 16:50:23,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:23,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:23,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:23,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:23,727 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:24,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:24,821 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:24,821 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:24,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:24,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:24,822 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:24,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:24,830 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:52:01,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:52:01,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:52:01,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:01,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:03,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:03,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 21] total 46 [2018-11-07 16:52:03,565 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:03,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:52:03,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:52:03,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=1549, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:52:03,567 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 27 states. [2018-11-07 16:52:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:05,479 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-11-07 16:52:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:52:05,480 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 334 [2018-11-07 16:52:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:05,482 INFO L225 Difference]: With dead ends: 348 [2018-11-07 16:52:05,484 INFO L226 Difference]: Without dead ends: 345 [2018-11-07 16:52:05,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 648 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=845, Invalid=2695, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 16:52:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-07 16:52:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2018-11-07 16:52:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-07 16:52:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-11-07 16:52:05,495 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 334 [2018-11-07 16:52:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:05,496 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-11-07 16:52:05,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:52:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-11-07 16:52:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-07 16:52:05,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:05,498 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:05,498 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:05,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1493590073, now seen corresponding path program 9 times [2018-11-07 16:52:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:05,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:52:05,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:05,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:06,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:06,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:06,359 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:06,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:06,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:06,359 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:52:06,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:52:06,372 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:52:09,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:52:09,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:52:09,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:09,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:11,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:11,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 22] total 48 [2018-11-07 16:52:11,943 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:11,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:52:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:52:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:52:11,944 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 28 states. [2018-11-07 16:52:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:13,721 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2018-11-07 16:52:13,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:52:13,722 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 340 [2018-11-07 16:52:13,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:13,725 INFO L225 Difference]: With dead ends: 354 [2018-11-07 16:52:13,725 INFO L226 Difference]: Without dead ends: 351 [2018-11-07 16:52:13,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 659 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=929, Invalid=2977, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 16:52:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-11-07 16:52:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2018-11-07 16:52:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-07 16:52:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-11-07 16:52:13,735 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 340 [2018-11-07 16:52:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:13,736 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-11-07 16:52:13,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:52:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-11-07 16:52:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-07 16:52:13,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:13,739 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:13,739 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:13,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1830769611, now seen corresponding path program 10 times [2018-11-07 16:52:13,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:13,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:52:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:13,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:15,491 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-07 16:52:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:16,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:16,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:16,222 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:16,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:16,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:16,222 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:52:16,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:52:16,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:52:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:18,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:18,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:20,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:20,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 50 [2018-11-07 16:52:20,275 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:20,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 16:52:20,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 16:52:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1835, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:52:20,278 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 29 states. [2018-11-07 16:52:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:22,882 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-11-07 16:52:22,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:52:22,883 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 346 [2018-11-07 16:52:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:22,887 INFO L225 Difference]: With dead ends: 360 [2018-11-07 16:52:22,887 INFO L226 Difference]: Without dead ends: 357 [2018-11-07 16:52:22,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 670 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1017, Invalid=3273, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 16:52:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-07 16:52:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2018-11-07 16:52:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-11-07 16:52:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-11-07 16:52:22,897 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 346 [2018-11-07 16:52:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:22,898 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-11-07 16:52:22,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 16:52:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-11-07 16:52:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-11-07 16:52:22,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:22,900 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:22,901 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:22,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash -993799715, now seen corresponding path program 11 times [2018-11-07 16:52:22,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:22,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:22,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:52:22,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:22,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:23,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:23,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:23,650 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:23,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:23,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:23,650 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:52:23,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:52:23,663 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown