java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label08_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 08:09:23,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 08:09:23,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 08:09:23,182 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 08:09:23,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 08:09:23,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 08:09:23,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 08:09:23,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 08:09:23,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 08:09:23,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 08:09:23,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 08:09:23,190 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 08:09:23,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 08:09:23,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 08:09:23,192 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 08:09:23,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 08:09:23,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 08:09:23,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 08:09:23,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 08:09:23,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 08:09:23,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 08:09:23,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 08:09:23,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 08:09:23,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 08:09:23,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 08:09:23,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 08:09:23,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 08:09:23,215 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 08:09:23,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 08:09:23,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 08:09:23,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 08:09:23,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 08:09:23,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 08:09:23,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 08:09:23,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 08:09:23,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 08:09:23,225 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 08:09:23,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 08:09:23,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 08:09:23,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 08:09:23,242 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 08:09:23,242 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 08:09:23,243 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 08:09:23,243 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 08:09:23,243 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 08:09:23,243 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 08:09:23,243 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 08:09:23,244 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 08:09:23,244 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 08:09:23,244 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 08:09:23,244 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 08:09:23,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 08:09:23,245 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 08:09:23,245 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 08:09:23,245 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 08:09:23,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 08:09:23,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 08:09:23,246 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 08:09:23,246 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 08:09:23,246 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 08:09:23,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 08:09:23,247 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 08:09:23,247 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 08:09:23,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 08:09:23,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 08:09:23,248 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 08:09:23,248 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 08:09:23,248 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 08:09:23,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 08:09:23,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 08:09:23,248 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 08:09:23,249 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 08:09:23,249 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 08:09:23,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 08:09:23,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 08:09:23,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 08:09:23,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 08:09:23,323 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 08:09:23,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label08_true-unreach-call.c [2018-10-27 08:09:23,389 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84dc2683c/d935deab42eb4fc6841424fbd21006ae/FLAGd43b97174 [2018-10-27 08:09:24,026 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 08:09:24,027 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label08_true-unreach-call.c [2018-10-27 08:09:24,048 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84dc2683c/d935deab42eb4fc6841424fbd21006ae/FLAGd43b97174 [2018-10-27 08:09:24,062 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84dc2683c/d935deab42eb4fc6841424fbd21006ae [2018-10-27 08:09:24,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 08:09:24,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 08:09:24,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 08:09:24,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 08:09:24,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 08:09:24,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 08:09:24" (1/1) ... [2018-10-27 08:09:24,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c86b51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:24, skipping insertion in model container [2018-10-27 08:09:24,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 08:09:24" (1/1) ... [2018-10-27 08:09:24,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 08:09:24,190 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 08:09:25,009 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 08:09:25,014 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 08:09:25,351 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 08:09:25,375 INFO L193 MainTranslator]: Completed translation [2018-10-27 08:09:25,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25 WrapperNode [2018-10-27 08:09:25,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 08:09:25,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 08:09:25,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 08:09:25,378 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 08:09:25,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:25,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:25,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 08:09:25,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 08:09:25,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 08:09:25,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 08:09:25,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:25,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:25,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:25,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:25,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:25,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:25,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... [2018-10-27 08:09:26,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 08:09:26,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 08:09:26,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 08:09:26,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 08:09:26,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 08:09:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 08:09:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 08:09:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-27 08:09:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-27 08:09:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 08:09:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 08:09:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 08:09:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 08:09:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 08:09:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 08:09:34,295 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 08:09:34,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 08:09:34 BoogieIcfgContainer [2018-10-27 08:09:34,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 08:09:34,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 08:09:34,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 08:09:34,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 08:09:34,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 08:09:24" (1/3) ... [2018-10-27 08:09:34,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fdc117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 08:09:34, skipping insertion in model container [2018-10-27 08:09:34,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 08:09:25" (2/3) ... [2018-10-27 08:09:34,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fdc117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 08:09:34, skipping insertion in model container [2018-10-27 08:09:34,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 08:09:34" (3/3) ... [2018-10-27 08:09:34,305 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label08_true-unreach-call.c [2018-10-27 08:09:34,314 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 08:09:34,323 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 08:09:34,341 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 08:09:34,383 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 08:09:34,383 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 08:09:34,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 08:09:34,384 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 08:09:34,384 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 08:09:34,384 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 08:09:34,384 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 08:09:34,384 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 08:09:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-27 08:09:34,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 08:09:34,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:09:34,434 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] [2018-10-27 08:09:34,436 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:09:34,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:09:34,442 INFO L82 PathProgramCache]: Analyzing trace with hash -561435596, now seen corresponding path program 1 times [2018-10-27 08:09:34,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:09:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:09:34,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:09:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:09:34,490 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:09:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:09:34,964 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 08:09:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 08:09:35,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 08:09:35,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 08:09:35,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:09:35,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 08:09:35,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 08:09:35,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 08:09:35,124 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 3 states. [2018-10-27 08:09:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:09:39,851 INFO L93 Difference]: Finished difference Result 1194 states and 2152 transitions. [2018-10-27 08:09:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 08:09:39,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-27 08:09:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:09:39,882 INFO L225 Difference]: With dead ends: 1194 [2018-10-27 08:09:39,883 INFO L226 Difference]: Without dead ends: 754 [2018-10-27 08:09:39,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 08:09:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-27 08:09:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2018-10-27 08:09:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-27 08:09:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1325 transitions. [2018-10-27 08:09:39,998 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1325 transitions. Word has length 58 [2018-10-27 08:09:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:09:39,999 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1325 transitions. [2018-10-27 08:09:39,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 08:09:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1325 transitions. [2018-10-27 08:09:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 08:09:40,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:09:40,009 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 08:09:40,009 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:09:40,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:09:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1198310345, now seen corresponding path program 1 times [2018-10-27 08:09:40,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:09:40,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:09:40,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:09:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:09:40,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:09:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:09:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 08:09:40,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 08:09:40,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 08:09:40,422 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:09:40,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 08:09:40,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 08:09:40,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 08:09:40,425 INFO L87 Difference]: Start difference. First operand 752 states and 1325 transitions. Second operand 6 states. [2018-10-27 08:09:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:09:55,682 INFO L93 Difference]: Finished difference Result 2839 states and 5159 transitions. [2018-10-27 08:09:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 08:09:55,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-10-27 08:09:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:09:55,703 INFO L225 Difference]: With dead ends: 2839 [2018-10-27 08:09:55,704 INFO L226 Difference]: Without dead ends: 2093 [2018-10-27 08:09:55,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 08:09:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-27 08:09:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2055. [2018-10-27 08:09:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-10-27 08:09:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3404 transitions. [2018-10-27 08:09:55,833 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3404 transitions. Word has length 132 [2018-10-27 08:09:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:09:55,834 INFO L481 AbstractCegarLoop]: Abstraction has 2055 states and 3404 transitions. [2018-10-27 08:09:55,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 08:09:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3404 transitions. [2018-10-27 08:09:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 08:09:55,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:09:55,840 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 08:09:55,840 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:09:55,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:09:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1211406466, now seen corresponding path program 1 times [2018-10-27 08:09:55,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:09:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:09:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:09:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:09:55,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:09:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:09:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 08:09:56,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 08:09:56,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 08:09:56,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:09:56,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 08:09:56,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 08:09:56,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 08:09:56,035 INFO L87 Difference]: Start difference. First operand 2055 states and 3404 transitions. Second operand 5 states. [2018-10-27 08:10:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:10:03,687 INFO L93 Difference]: Finished difference Result 6122 states and 10301 transitions. [2018-10-27 08:10:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 08:10:03,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-10-27 08:10:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:10:03,714 INFO L225 Difference]: With dead ends: 6122 [2018-10-27 08:10:03,714 INFO L226 Difference]: Without dead ends: 4073 [2018-10-27 08:10:03,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 08:10:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2018-10-27 08:10:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3996. [2018-10-27 08:10:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3996 states. [2018-10-27 08:10:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 5874 transitions. [2018-10-27 08:10:03,862 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 5874 transitions. Word has length 135 [2018-10-27 08:10:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:10:03,863 INFO L481 AbstractCegarLoop]: Abstraction has 3996 states and 5874 transitions. [2018-10-27 08:10:03,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 08:10:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 5874 transitions. [2018-10-27 08:10:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-27 08:10:03,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:10:03,867 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 08:10:03,867 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:10:03,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:10:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1183440816, now seen corresponding path program 1 times [2018-10-27 08:10:03,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:10:03,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:10:03,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:10:03,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:10:03,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:10:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:10:04,083 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 08:10:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 08:10:04,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 08:10:04,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 08:10:04,146 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:10:04,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 08:10:04,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 08:10:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 08:10:04,147 INFO L87 Difference]: Start difference. First operand 3996 states and 5874 transitions. Second operand 6 states. [2018-10-27 08:10:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:10:11,441 INFO L93 Difference]: Finished difference Result 11083 states and 16941 transitions. [2018-10-27 08:10:11,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 08:10:11,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-10-27 08:10:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:10:11,490 INFO L225 Difference]: With dead ends: 11083 [2018-10-27 08:10:11,491 INFO L226 Difference]: Without dead ends: 7093 [2018-10-27 08:10:11,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 08:10:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7093 states. [2018-10-27 08:10:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7093 to 6984. [2018-10-27 08:10:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6984 states. [2018-10-27 08:10:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6984 states to 6984 states and 9527 transitions. [2018-10-27 08:10:11,759 INFO L78 Accepts]: Start accepts. Automaton has 6984 states and 9527 transitions. Word has length 145 [2018-10-27 08:10:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:10:11,760 INFO L481 AbstractCegarLoop]: Abstraction has 6984 states and 9527 transitions. [2018-10-27 08:10:11,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 08:10:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6984 states and 9527 transitions. [2018-10-27 08:10:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 08:10:11,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:10:11,765 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 08:10:11,766 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:10:11,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:10:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash 984930483, now seen corresponding path program 1 times [2018-10-27 08:10:11,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:10:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:10:11,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:10:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:10:11,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:10:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:10:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 08:10:12,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 08:10:12,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 08:10:12,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:10:12,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 08:10:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 08:10:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 08:10:12,235 INFO L87 Difference]: Start difference. First operand 6984 states and 9527 transitions. Second operand 5 states. [2018-10-27 08:10:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:10:25,621 INFO L93 Difference]: Finished difference Result 18666 states and 26327 transitions. [2018-10-27 08:10:25,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 08:10:25,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-10-27 08:10:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:10:25,685 INFO L225 Difference]: With dead ends: 18666 [2018-10-27 08:10:25,685 INFO L226 Difference]: Without dead ends: 11688 [2018-10-27 08:10:25,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 08:10:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11688 states. [2018-10-27 08:10:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11688 to 11527. [2018-10-27 08:10:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11527 states. [2018-10-27 08:10:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11527 states to 11527 states and 15503 transitions. [2018-10-27 08:10:26,011 INFO L78 Accepts]: Start accepts. Automaton has 11527 states and 15503 transitions. Word has length 155 [2018-10-27 08:10:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:10:26,012 INFO L481 AbstractCegarLoop]: Abstraction has 11527 states and 15503 transitions. [2018-10-27 08:10:26,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 08:10:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 11527 states and 15503 transitions. [2018-10-27 08:10:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-27 08:10:26,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:10:26,016 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 08:10:26,017 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:10:26,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:10:26,017 INFO L82 PathProgramCache]: Analyzing trace with hash 528602966, now seen corresponding path program 1 times [2018-10-27 08:10:26,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:10:26,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:10:26,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:10:26,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:10:26,018 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:10:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:10:26,590 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-27 08:10:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 08:10:26,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 08:10:26,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 08:10:26,937 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-10-27 08:10:26,939 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 08:10:27,003 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 08:10:27,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 08:10:27,486 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 08:10:27,488 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-27 08:10:27,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:10:27,496 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 08:10:27,986 INFO L227 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 78.37% of their original sizes. [2018-10-27 08:10:27,986 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 08:10:28,237 INFO L415 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2018-10-27 08:10:28,237 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 08:10:28,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 08:10:28,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-27 08:10:28,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:10:28,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 08:10:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 08:10:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 08:10:28,240 INFO L87 Difference]: Start difference. First operand 11527 states and 15503 transitions. Second operand 6 states. [2018-10-27 08:11:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:11:43,548 INFO L93 Difference]: Finished difference Result 23041 states and 30996 transitions. [2018-10-27 08:11:43,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 08:11:43,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-10-27 08:11:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:11:43,591 INFO L225 Difference]: With dead ends: 23041 [2018-10-27 08:11:43,592 INFO L226 Difference]: Without dead ends: 11520 [2018-10-27 08:11:43,635 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 08:11:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11520 states. [2018-10-27 08:11:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11520 to 11518. [2018-10-27 08:11:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11518 states. [2018-10-27 08:11:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 15462 transitions. [2018-10-27 08:11:43,864 INFO L78 Accepts]: Start accepts. Automaton has 11518 states and 15462 transitions. Word has length 170 [2018-10-27 08:11:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:11:43,865 INFO L481 AbstractCegarLoop]: Abstraction has 11518 states and 15462 transitions. [2018-10-27 08:11:43,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 08:11:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 11518 states and 15462 transitions. [2018-10-27 08:11:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-27 08:11:43,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:11:43,873 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 08:11:43,874 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:11:43,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:11:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1907556257, now seen corresponding path program 1 times [2018-10-27 08:11:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:11:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:11:43,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:11:43,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:11:43,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:11:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:11:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 08:11:44,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 08:11:44,847 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 08:11:44,847 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-10-27 08:11:44,848 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 08:11:44,853 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 08:11:44,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 08:11:45,091 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 08:11:45,091 INFO L272 AbstractInterpreter]: Visited 120 different actions 347 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 08:11:45,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:11:45,130 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 08:11:45,405 INFO L227 lantSequenceWeakener]: Weakened 263 states. On average, predicates are now at 84.1% of their original sizes. [2018-10-27 08:11:45,406 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 08:11:45,598 INFO L415 sIntCurrentIteration]: We unified 265 AI predicates to 265 [2018-10-27 08:11:45,598 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 08:11:45,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 08:11:45,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2018-10-27 08:11:45,599 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:11:45,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 08:11:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 08:11:45,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 08:11:45,600 INFO L87 Difference]: Start difference. First operand 11518 states and 15462 transitions. Second operand 9 states. [2018-10-27 08:12:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:12:38,286 INFO L93 Difference]: Finished difference Result 23317 states and 31287 transitions. [2018-10-27 08:12:38,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 08:12:38,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 266 [2018-10-27 08:12:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:12:38,323 INFO L225 Difference]: With dead ends: 23317 [2018-10-27 08:12:38,323 INFO L226 Difference]: Without dead ends: 12113 [2018-10-27 08:12:38,343 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-10-27 08:12:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12113 states. [2018-10-27 08:12:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12113 to 12108. [2018-10-27 08:12:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12108 states. [2018-10-27 08:12:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12108 states to 12108 states and 16085 transitions. [2018-10-27 08:12:38,559 INFO L78 Accepts]: Start accepts. Automaton has 12108 states and 16085 transitions. Word has length 266 [2018-10-27 08:12:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:12:38,560 INFO L481 AbstractCegarLoop]: Abstraction has 12108 states and 16085 transitions. [2018-10-27 08:12:38,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 08:12:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 12108 states and 16085 transitions. [2018-10-27 08:12:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-27 08:12:38,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:12:38,569 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 08:12:38,570 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:12:38,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:12:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1260253826, now seen corresponding path program 1 times [2018-10-27 08:12:38,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:12:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:12:38,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:12:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:12:38,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:12:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:12:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-27 08:12:39,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 08:12:39,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 08:12:39,029 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:12:39,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 08:12:39,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 08:12:39,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 08:12:39,030 INFO L87 Difference]: Start difference. First operand 12108 states and 16085 transitions. Second operand 4 states. [2018-10-27 08:12:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:12:45,406 INFO L93 Difference]: Finished difference Result 38387 states and 54196 transitions. [2018-10-27 08:12:45,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 08:12:45,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 355 [2018-10-27 08:12:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:12:45,494 INFO L225 Difference]: With dead ends: 38387 [2018-10-27 08:12:45,494 INFO L226 Difference]: Without dead ends: 26593 [2018-10-27 08:12:45,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 08:12:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26593 states. [2018-10-27 08:12:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26593 to 26549. [2018-10-27 08:12:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26549 states. [2018-10-27 08:12:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26549 states to 26549 states and 34712 transitions. [2018-10-27 08:12:46,056 INFO L78 Accepts]: Start accepts. Automaton has 26549 states and 34712 transitions. Word has length 355 [2018-10-27 08:12:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:12:46,057 INFO L481 AbstractCegarLoop]: Abstraction has 26549 states and 34712 transitions. [2018-10-27 08:12:46,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 08:12:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26549 states and 34712 transitions. [2018-10-27 08:12:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-27 08:12:46,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:12:46,085 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 08:12:46,085 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:12:46,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:12:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash -607951813, now seen corresponding path program 1 times [2018-10-27 08:12:46,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:12:46,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:12:46,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:12:46,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:12:46,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:12:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:12:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-27 08:12:46,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 08:12:46,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 08:12:46,598 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:12:46,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 08:12:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 08:12:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 08:12:46,600 INFO L87 Difference]: Start difference. First operand 26549 states and 34712 transitions. Second operand 4 states. [2018-10-27 08:12:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:12:52,031 INFO L93 Difference]: Finished difference Result 62642 states and 87376 transitions. [2018-10-27 08:12:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 08:12:52,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 478 [2018-10-27 08:12:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:12:52,171 INFO L225 Difference]: With dead ends: 62642 [2018-10-27 08:12:52,171 INFO L226 Difference]: Without dead ends: 38092 [2018-10-27 08:12:52,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 08:12:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38092 states. [2018-10-27 08:12:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38092 to 37409. [2018-10-27 08:12:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37409 states. [2018-10-27 08:12:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37409 states to 37409 states and 50538 transitions. [2018-10-27 08:12:53,031 INFO L78 Accepts]: Start accepts. Automaton has 37409 states and 50538 transitions. Word has length 478 [2018-10-27 08:12:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:12:53,033 INFO L481 AbstractCegarLoop]: Abstraction has 37409 states and 50538 transitions. [2018-10-27 08:12:53,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 08:12:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37409 states and 50538 transitions. [2018-10-27 08:12:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-10-27 08:12:53,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:12:53,073 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 08:12:53,074 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:12:53,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:12:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1242031723, now seen corresponding path program 1 times [2018-10-27 08:12:53,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:12:53,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:12:53,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:12:53,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:12:53,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:12:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:12:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-27 08:12:53,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 08:12:53,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 08:12:53,524 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 08:12:53,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 08:12:53,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 08:12:53,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 08:12:53,525 INFO L87 Difference]: Start difference. First operand 37409 states and 50538 transitions. Second operand 3 states. [2018-10-27 08:12:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 08:12:59,176 INFO L93 Difference]: Finished difference Result 78342 states and 112152 transitions. [2018-10-27 08:12:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 08:12:59,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 503 [2018-10-27 08:12:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 08:12:59,345 INFO L225 Difference]: With dead ends: 78342 [2018-10-27 08:12:59,346 INFO L226 Difference]: Without dead ends: 42932 [2018-10-27 08:12:59,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 08:12:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42932 states. [2018-10-27 08:13:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42932 to 42927. [2018-10-27 08:13:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42927 states. [2018-10-27 08:13:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42927 states to 42927 states and 58827 transitions. [2018-10-27 08:13:00,298 INFO L78 Accepts]: Start accepts. Automaton has 42927 states and 58827 transitions. Word has length 503 [2018-10-27 08:13:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 08:13:00,299 INFO L481 AbstractCegarLoop]: Abstraction has 42927 states and 58827 transitions. [2018-10-27 08:13:00,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 08:13:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 42927 states and 58827 transitions. [2018-10-27 08:13:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-10-27 08:13:00,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 08:13:00,336 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 08:13:00,336 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 08:13:00,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:13:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1307073957, now seen corresponding path program 1 times [2018-10-27 08:13:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 08:13:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:13:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:13:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 08:13:00,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 08:13:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:13:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 08:13:01,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 08:13:01,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 08:13:01,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 546 with the following transitions: [2018-10-27 08:13:01,224 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [880], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-27 08:13:01,232 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 08:13:01,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 08:13:02,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 08:13:02,590 INFO L272 AbstractInterpreter]: Visited 285 different actions 1133 times. Merged at 8 different actions 28 times. Never widened. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 08:13:02,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 08:13:02,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 08:13:02,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 08:13:02,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 08:13:02,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 08:13:02,606 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 08:13:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 08:13:02,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 08:13:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 08:13:03,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 08:13:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 08:13:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 08:13:04,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-27 08:13:04,017 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 08:13:04,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 08:13:04,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 08:13:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 08:13:04,019 INFO L87 Difference]: Start difference. First operand 42927 states and 58827 transitions. Second operand 9 states. Received shutdown request... [2018-10-27 08:13:15,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 08:13:15,754 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 08:13:15,760 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 08:13:15,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 08:13:15 BoogieIcfgContainer [2018-10-27 08:13:15,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 08:13:15,761 INFO L168 Benchmark]: Toolchain (without parser) took 231687.57 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -227.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-27 08:13:15,762 INFO L168 Benchmark]: CDTParser took 1.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 08:13:15,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1300.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-27 08:13:15,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 421.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -874.5 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-27 08:13:15,765 INFO L168 Benchmark]: Boogie Preprocessor took 219.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-27 08:13:15,765 INFO L168 Benchmark]: RCFGBuilder took 8277.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 306.2 MB). Peak memory consumption was 306.2 MB. Max. memory is 7.1 GB. [2018-10-27 08:13:15,766 INFO L168 Benchmark]: TraceAbstraction took 221463.57 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.9 GB in the beginning and 1.7 GB in the end (delta: 221.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-27 08:13:15,771 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1300.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 421.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -874.5 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 219.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8277.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 306.2 MB). Peak memory consumption was 306.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221463.57 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.9 GB in the beginning and 1.7 GB in the end (delta: 221.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 160). Cancelled while BasicCegarLoop was constructing difference of abstraction (42927states) and FLOYD_HOARE automaton (currently 23 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (57784 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. TIMEOUT Result, 221.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 206.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3514 SDtfs, 12339 SDslu, 2812 SDs, 0 SdLazy, 24969 SolverSat, 4723 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 161.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1624 GetRequests, 1546 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42927occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9972320589500399 AbsIntWeakeningRatio, 0.10599078341013825 AbsIntAvgWeakeningVarsNumRemoved, 15.419354838709678 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1126 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 3487 NumberOfCodeBlocks, 3487 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 4019 ConstructedInterpolants, 0 QuantifiedInterpolants, 3911864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 2581/2640 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown