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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 19:16:23,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 19:16:23,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 19:16:23,216 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 19:16:23,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 19:16:23,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 19:16:23,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 19:16:23,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 19:16:23,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 19:16:23,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 19:16:23,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 19:16:23,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 19:16:23,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 19:16:23,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 19:16:23,229 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 19:16:23,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 19:16:23,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 19:16:23,232 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 19:16:23,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 19:16:23,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 19:16:23,238 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 19:16:23,239 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 19:16:23,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 19:16:23,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 19:16:23,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 19:16:23,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 19:16:23,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 19:16:23,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 19:16:23,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 19:16:23,248 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 19:16:23,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 19:16:23,249 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 19:16:23,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 19:16:23,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 19:16:23,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 19:16:23,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 19:16:23,253 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 19:16:23,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 19:16:23,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 19:16:23,271 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 19:16:23,271 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 19:16:23,271 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 19:16:23,271 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 19:16:23,272 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 19:16:23,272 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 19:16:23,272 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 19:16:23,272 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 19:16:23,273 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 19:16:23,273 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 19:16:23,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 19:16:23,274 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 19:16:23,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 19:16:23,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 19:16:23,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 19:16:23,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 19:16:23,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 19:16:23,276 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 19:16:23,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 19:16:23,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 19:16:23,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 19:16:23,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 19:16:23,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 19:16:23,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 19:16:23,277 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 19:16:23,277 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 19:16:23,277 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 19:16:23,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 19:16:23,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 19:16:23,280 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 19:16:23,280 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 19:16:23,280 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 19:16:23,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 19:16:23,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 19:16:23,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 19:16:23,382 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 19:16:23,383 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 19:16:23,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-10-24 19:16:23,461 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84a639831/fe08d65d0ae44e50ac5afdf892f40104/FLAG2c1f67426 [2018-10-24 19:16:24,119 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 19:16:24,122 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-10-24 19:16:24,145 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84a639831/fe08d65d0ae44e50ac5afdf892f40104/FLAG2c1f67426 [2018-10-24 19:16:24,167 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84a639831/fe08d65d0ae44e50ac5afdf892f40104 [2018-10-24 19:16:24,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 19:16:24,183 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 19:16:24,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 19:16:24,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 19:16:24,192 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 19:16:24,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:24,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24, skipping insertion in model container [2018-10-24 19:16:24,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:24,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 19:16:24,283 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 19:16:24,805 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:16:24,811 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 19:16:24,954 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:16:24,994 INFO L193 MainTranslator]: Completed translation [2018-10-24 19:16:24,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24 WrapperNode [2018-10-24 19:16:24,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 19:16:24,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 19:16:24,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 19:16:24,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 19:16:25,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 19:16:25,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 19:16:25,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 19:16:25,256 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 19:16:25,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (1/1) ... [2018-10-24 19:16:25,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 19:16:25,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 19:16:25,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 19:16:25,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 19:16:25,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (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-24 19:16:25,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 19:16:25,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 19:16:25,421 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 19:16:25,421 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 19:16:25,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 19:16:25,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 19:16:25,422 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 19:16:25,422 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 19:16:28,946 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 19:16:28,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:16:28 BoogieIcfgContainer [2018-10-24 19:16:28,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 19:16:28,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 19:16:28,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 19:16:28,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 19:16:28,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:16:24" (1/3) ... [2018-10-24 19:16:28,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b16a889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:16:28, skipping insertion in model container [2018-10-24 19:16:28,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:16:24" (2/3) ... [2018-10-24 19:16:28,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b16a889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:16:28, skipping insertion in model container [2018-10-24 19:16:28,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:16:28" (3/3) ... [2018-10-24 19:16:28,958 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-10-24 19:16:28,969 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 19:16:28,983 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 19:16:29,003 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 19:16:29,059 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 19:16:29,060 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 19:16:29,060 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 19:16:29,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 19:16:29,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 19:16:29,061 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 19:16:29,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 19:16:29,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 19:16:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-24 19:16:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-24 19:16:29,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:16:29,135 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] [2018-10-24 19:16:29,140 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:16:29,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:16:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2096081016, now seen corresponding path program 1 times [2018-10-24 19:16:29,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:16:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:16:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:29,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:16:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:16:29,813 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:16:30,078 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-24 19:16:30,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:16:30,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 19:16:30,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:16:30,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 19:16:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 19:16:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:16:30,111 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-24 19:16:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:16:32,023 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-24 19:16:32,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 19:16:32,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-24 19:16:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:16:32,044 INFO L225 Difference]: With dead ends: 550 [2018-10-24 19:16:32,045 INFO L226 Difference]: Without dead ends: 340 [2018-10-24 19:16:32,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 19:16:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-24 19:16:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-24 19:16:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-24 19:16:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-24 19:16:32,136 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 108 [2018-10-24 19:16:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:16:32,137 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-24 19:16:32,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 19:16:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-24 19:16:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-24 19:16:32,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:16:32,145 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 19:16:32,146 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:16:32,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:16:32,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1737414697, now seen corresponding path program 1 times [2018-10-24 19:16:32,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:16:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:32,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:16:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:32,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:16:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:16:32,359 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:16:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:16:32,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:16:32,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:16:32,444 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:16:32,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:16:32,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:16:32,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:16:32,448 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-24 19:16:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:16:34,510 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-24 19:16:34,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:16:34,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-10-24 19:16:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:16:34,519 INFO L225 Difference]: With dead ends: 888 [2018-10-24 19:16:34,519 INFO L226 Difference]: Without dead ends: 554 [2018-10-24 19:16:34,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 19:16:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-24 19:16:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-24 19:16:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-24 19:16:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-24 19:16:34,570 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 119 [2018-10-24 19:16:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:16:34,570 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-24 19:16:34,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:16:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-24 19:16:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-24 19:16:34,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:16:34,577 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:16:34,577 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:16:34,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:16:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1875739691, now seen corresponding path program 1 times [2018-10-24 19:16:34,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:16:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:34,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:16:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:34,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:16:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:16:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:16:35,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:16:35,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:16:35,014 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:16:35,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:16:35,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:16:35,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:16:35,015 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-24 19:16:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:16:36,841 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-24 19:16:36,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:16:36,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-10-24 19:16:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:16:36,849 INFO L225 Difference]: With dead ends: 1210 [2018-10-24 19:16:36,849 INFO L226 Difference]: Without dead ends: 536 [2018-10-24 19:16:36,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:16:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-24 19:16:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-24 19:16:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-24 19:16:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-24 19:16:36,910 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 120 [2018-10-24 19:16:36,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:16:36,910 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-24 19:16:36,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:16:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-24 19:16:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-24 19:16:36,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:16:36,914 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:16:36,914 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:16:36,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:16:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash 967812819, now seen corresponding path program 1 times [2018-10-24 19:16:36,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:16:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:36,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:16:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:36,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:16:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:16:37,761 WARN L179 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-24 19:16:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:16:37,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:16:37,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:16:37,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:16:37,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:16:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:16:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:16:37,876 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-24 19:16:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:16:40,182 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-24 19:16:40,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:16:40,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-24 19:16:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:16:40,187 INFO L225 Difference]: With dead ends: 1204 [2018-10-24 19:16:40,188 INFO L226 Difference]: Without dead ends: 535 [2018-10-24 19:16:40,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:16:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-24 19:16:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-24 19:16:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-24 19:16:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-24 19:16:40,214 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 121 [2018-10-24 19:16:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:16:40,215 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-24 19:16:40,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:16:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-24 19:16:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-24 19:16:40,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:16:40,218 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 19:16:40,218 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:16:40,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:16:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash -394694497, now seen corresponding path program 1 times [2018-10-24 19:16:40,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:16:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:40,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:16:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:40,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:16:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:16:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:16:40,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:16:40,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 19:16:40,437 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:16:40,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 19:16:40,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 19:16:40,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:16:40,440 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-24 19:16:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:16:41,919 INFO L93 Difference]: Finished difference Result 1522 states and 2300 transitions. [2018-10-24 19:16:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 19:16:41,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-24 19:16:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:16:41,934 INFO L225 Difference]: With dead ends: 1522 [2018-10-24 19:16:41,934 INFO L226 Difference]: Without dead ends: 993 [2018-10-24 19:16:41,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:16:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-10-24 19:16:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2018-10-24 19:16:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-10-24 19:16:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1418 transitions. [2018-10-24 19:16:41,977 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1418 transitions. Word has length 126 [2018-10-24 19:16:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:16:41,979 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1418 transitions. [2018-10-24 19:16:41,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 19:16:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1418 transitions. [2018-10-24 19:16:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-24 19:16:41,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:16:41,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 19:16:41,984 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:16:41,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:16:41,985 INFO L82 PathProgramCache]: Analyzing trace with hash -97847665, now seen corresponding path program 1 times [2018-10-24 19:16:41,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:16:41,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:41,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:16:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:41,987 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:16:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:16:42,203 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:16:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:16:42,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:16:42,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:16:42,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:16:42,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:16:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:16:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:16:42,235 INFO L87 Difference]: Start difference. First operand 993 states and 1418 transitions. Second operand 6 states. [2018-10-24 19:16:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:16:43,345 INFO L93 Difference]: Finished difference Result 2917 states and 4405 transitions. [2018-10-24 19:16:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:16:43,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-10-24 19:16:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:16:43,359 INFO L225 Difference]: With dead ends: 2917 [2018-10-24 19:16:43,359 INFO L226 Difference]: Without dead ends: 1930 [2018-10-24 19:16:43,366 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-24 19:16:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-10-24 19:16:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1875. [2018-10-24 19:16:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-10-24 19:16:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2525 transitions. [2018-10-24 19:16:43,430 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2525 transitions. Word has length 134 [2018-10-24 19:16:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:16:43,430 INFO L481 AbstractCegarLoop]: Abstraction has 1875 states and 2525 transitions. [2018-10-24 19:16:43,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:16:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2525 transitions. [2018-10-24 19:16:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-24 19:16:43,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:16:43,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 19:16:43,437 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:16:43,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:16:43,438 INFO L82 PathProgramCache]: Analyzing trace with hash -261653377, now seen corresponding path program 1 times [2018-10-24 19:16:43,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:16:43,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:43,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:16:43,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:16:43,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:16:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:16:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:16:43,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 19:16:43,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 19:16:43,832 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-10-24 19:16:43,835 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 19:16:43,908 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 19:16:43,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 19:16:52,855 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 19:16:52,856 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-24 19:16:52,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:16:52,869 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 19:16:55,663 INFO L232 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 79.78% of their original sizes. [2018-10-24 19:16:55,663 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 19:16:57,025 INFO L413 sIntCurrentIteration]: We have 141 unified AI predicates [2018-10-24 19:16:57,026 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 19:16:57,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 19:16:57,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-10-24 19:16:57,027 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:16:57,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 19:16:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 19:16:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-24 19:16:57,029 INFO L87 Difference]: Start difference. First operand 1875 states and 2525 transitions. Second operand 12 states. [2018-10-24 19:17:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:17:11,873 INFO L93 Difference]: Finished difference Result 3805 states and 5126 transitions. [2018-10-24 19:17:11,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 19:17:11,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2018-10-24 19:17:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:17:11,884 INFO L225 Difference]: With dead ends: 3805 [2018-10-24 19:17:11,884 INFO L226 Difference]: Without dead ends: 1936 [2018-10-24 19:17:11,891 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-24 19:17:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-10-24 19:17:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1936. [2018-10-24 19:17:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-10-24 19:17:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2591 transitions. [2018-10-24 19:17:11,950 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2591 transitions. Word has length 142 [2018-10-24 19:17:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:17:11,950 INFO L481 AbstractCegarLoop]: Abstraction has 1936 states and 2591 transitions. [2018-10-24 19:17:11,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 19:17:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2591 transitions. [2018-10-24 19:17:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-24 19:17:11,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:17:11,957 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:17:11,957 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:17:11,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:17:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash 276654452, now seen corresponding path program 1 times [2018-10-24 19:17:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:17:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:17:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:17:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:17:11,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:17:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:17:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:17:12,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 19:17:12,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 19:17:12,235 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-10-24 19:17:12,236 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-24 19:17:12,242 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 19:17:12,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 19:17:34,648 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 19:17:34,648 INFO L272 AbstractInterpreter]: Visited 112 different actions 178 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-24 19:17:34,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:17:34,655 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 19:17:38,608 INFO L232 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 80.78% of their original sizes. [2018-10-24 19:17:38,609 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 19:19:28,812 INFO L413 sIntCurrentIteration]: We have 143 unified AI predicates [2018-10-24 19:19:28,812 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 19:19:28,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 19:19:28,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-10-24 19:19:28,813 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:19:28,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 19:19:28,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 19:19:28,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-10-24 19:19:28,814 INFO L87 Difference]: Start difference. First operand 1936 states and 2591 transitions. Second operand 19 states. Received shutdown request... [2018-10-24 19:20:41,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 19:20:41,036 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 19:20:41,042 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 19:20:41,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:20:41 BoogieIcfgContainer [2018-10-24 19:20:41,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 19:20:41,044 INFO L168 Benchmark]: Toolchain (without parser) took 256862.96 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 230.8 MB. Max. memory is 7.1 GB. [2018-10-24 19:20:41,045 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 19:20:41,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 19:20:41,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 259.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-24 19:20:41,047 INFO L168 Benchmark]: Boogie Preprocessor took 68.97 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 19:20:41,048 INFO L168 Benchmark]: RCFGBuilder took 3622.83 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2018-10-24 19:20:41,049 INFO L168 Benchmark]: TraceAbstraction took 252093.98 ms. Allocated memory was 2.2 GB in the beginning and 3.3 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -922.2 MB). Peak memory consumption was 172.0 MB. Max. memory is 7.1 GB. [2018-10-24 19:20:41,054 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 259.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.97 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3622.83 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252093.98 ms. Allocated memory was 2.2 GB in the beginning and 3.3 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -922.2 MB). Peak memory consumption was 172.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 479]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 479). Cancelled while BasicCegarLoop was constructing difference of abstraction (1936states) and FLOYD_HOARE automaton (currently 19 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 251.9s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 97.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 825 SDtfs, 3093 SDslu, 757 SDs, 0 SdLazy, 4314 SolverSat, 838 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 345 GetRequests, 227 SyntacticMatches, 53 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 131.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1936occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 31.4s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9944463529142338 AbsIntWeakeningRatio, 0.22535211267605634 AbsIntAvgWeakeningVarsNumRemoved, 2035.0528169014085 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 70 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1014 NumberOfCodeBlocks, 1014 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1006 ConstructedInterpolants, 0 QuantifiedInterpolants, 777616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 102/135 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown