java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 00:57:49,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 00:57:49,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 00:57:49,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 00:57:49,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 00:57:49,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 00:57:49,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 00:57:49,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 00:57:49,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 00:57:49,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 00:57:49,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 00:57:49,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 00:57:49,186 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 00:57:49,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 00:57:49,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 00:57:49,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 00:57:49,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 00:57:49,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 00:57:49,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 00:57:49,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 00:57:49,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 00:57:49,199 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 00:57:49,201 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 00:57:49,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 00:57:49,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 00:57:49,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 00:57:49,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 00:57:49,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 00:57:49,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 00:57:49,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 00:57:49,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 00:57:49,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 00:57:49,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 00:57:49,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 00:57:49,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 00:57:49,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 00:57:49,211 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 00:57:49,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 00:57:49,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 00:57:49,229 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 00:57:49,229 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 00:57:49,229 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 00:57:49,229 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 00:57:49,230 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 00:57:49,230 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 00:57:49,230 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 00:57:49,230 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 00:57:49,230 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 00:57:49,231 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 00:57:49,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 00:57:49,232 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 00:57:49,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 00:57:49,232 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 00:57:49,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 00:57:49,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 00:57:49,233 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 00:57:49,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 00:57:49,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 00:57:49,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 00:57:49,233 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 00:57:49,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 00:57:49,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 00:57:49,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 00:57:49,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 00:57:49,234 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 00:57:49,235 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 00:57:49,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 00:57:49,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 00:57:49,235 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 00:57:49,235 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 00:57:49,235 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 00:57:49,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 00:57:49,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 00:57:49,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 00:57:49,307 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 00:57:49,307 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 00:57:49,308 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-11-07 00:57:49,377 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f5868ca/dae6f04e80f14be9b0304afece09d0de/FLAG4cc5a773c [2018-11-07 00:57:50,035 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 00:57:50,038 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-11-07 00:57:50,057 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f5868ca/dae6f04e80f14be9b0304afece09d0de/FLAG4cc5a773c [2018-11-07 00:57:50,081 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f5868ca/dae6f04e80f14be9b0304afece09d0de [2018-11-07 00:57:50,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 00:57:50,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 00:57:50,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 00:57:50,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 00:57:50,108 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 00:57:50,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:50,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4070c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50, skipping insertion in model container [2018-11-07 00:57:50,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:50,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 00:57:50,210 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 00:57:50,689 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 00:57:50,694 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 00:57:50,788 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 00:57:50,807 INFO L193 MainTranslator]: Completed translation [2018-11-07 00:57:50,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50 WrapperNode [2018-11-07 00:57:50,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 00:57:50,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 00:57:50,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 00:57:50,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 00:57:50,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:50,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:50,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 00:57:50,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 00:57:50,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 00:57:50,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 00:57:50,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:50,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:50,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:50,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:51,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:51,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:51,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... [2018-11-07 00:57:51,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 00:57:51,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 00:57:51,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 00:57:51,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 00:57:51,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 00:57:51,160 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 00:57:51,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 00:57:51,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 00:57:51,161 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 00:57:51,161 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 00:57:51,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 00:57:51,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 00:57:51,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 00:57:51,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 00:57:54,404 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 00:57:54,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:54 BoogieIcfgContainer [2018-11-07 00:57:54,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 00:57:54,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 00:57:54,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 00:57:54,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 00:57:54,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:57:50" (1/3) ... [2018-11-07 00:57:54,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ef5f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:54, skipping insertion in model container [2018-11-07 00:57:54,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50" (2/3) ... [2018-11-07 00:57:54,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ef5f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:54, skipping insertion in model container [2018-11-07 00:57:54,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:54" (3/3) ... [2018-11-07 00:57:54,420 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label06_true-unreach-call_false-termination.c [2018-11-07 00:57:54,435 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 00:57:54,451 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 00:57:54,470 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 00:57:54,528 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 00:57:54,529 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 00:57:54,529 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 00:57:54,529 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 00:57:54,530 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 00:57:54,530 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 00:57:54,530 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 00:57:54,530 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 00:57:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 00:57:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 00:57:54,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:57:54,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:57:54,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:57:54,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:57:54,630 INFO L82 PathProgramCache]: Analyzing trace with hash 482475453, now seen corresponding path program 1 times [2018-11-07 00:57:54,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:57:54,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:57:54,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:57:54,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:57:54,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:57:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:57:55,306 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 00:57:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:57:55,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:57:55,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 00:57:55,486 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:57:55,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 00:57:55,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 00:57:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 00:57:55,517 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 00:57:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:57:57,121 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 00:57:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 00:57:57,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-07 00:57:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:57:57,144 INFO L225 Difference]: With dead ends: 550 [2018-11-07 00:57:57,144 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 00:57:57,152 INFO L604 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-11-07 00:57:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 00:57:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 00:57:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 00:57:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-11-07 00:57:57,243 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 131 [2018-11-07 00:57:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:57:57,244 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-11-07 00:57:57,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 00:57:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-11-07 00:57:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 00:57:57,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:57:57,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:57:57,253 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:57:57,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:57:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash -359292034, now seen corresponding path program 1 times [2018-11-07 00:57:57,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:57:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:57:57,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:57:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:57:57,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:57:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:57:57,504 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 00:57:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:57:57,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:57:57,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:57:57,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:57:57,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:57:57,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:57:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:57:57,658 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-11-07 00:57:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:57:59,753 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-11-07 00:57:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:57:59,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-11-07 00:57:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:57:59,764 INFO L225 Difference]: With dead ends: 1075 [2018-11-07 00:57:59,765 INFO L226 Difference]: Without dead ends: 741 [2018-11-07 00:57:59,772 INFO L604 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-11-07 00:57:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-07 00:57:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-07 00:57:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-07 00:57:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-11-07 00:57:59,844 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 142 [2018-11-07 00:57:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:57:59,845 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-11-07 00:57:59,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:57:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-11-07 00:57:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 00:57:59,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:57:59,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:57:59,851 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:57:59,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:57:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash -879449942, now seen corresponding path program 1 times [2018-11-07 00:57:59,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:57:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:57:59,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:57:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:57:59,854 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:57:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:58:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:58:00,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:58:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 00:58:00,278 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:58:00,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 00:58:00,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 00:58:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 00:58:00,280 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 5 states. [2018-11-07 00:58:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:58:02,371 INFO L93 Difference]: Finished difference Result 1578 states and 2483 transitions. [2018-11-07 00:58:02,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 00:58:02,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 00:58:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:58:02,377 INFO L225 Difference]: With dead ends: 1578 [2018-11-07 00:58:02,377 INFO L226 Difference]: Without dead ends: 721 [2018-11-07 00:58:02,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 00:58:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-07 00:58:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-07 00:58:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-07 00:58:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1044 transitions. [2018-11-07 00:58:02,405 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1044 transitions. Word has length 143 [2018-11-07 00:58:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:58:02,405 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1044 transitions. [2018-11-07 00:58:02,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 00:58:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1044 transitions. [2018-11-07 00:58:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 00:58:02,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:58:02,410 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 00:58:02,410 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:58:02,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:58:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash 353210034, now seen corresponding path program 1 times [2018-11-07 00:58:02,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:58:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:58:02,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:58:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:58:02,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:58:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:58:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:58:02,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:58:02,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 00:58:02,584 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:58:02,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 00:58:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 00:58:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 00:58:02,586 INFO L87 Difference]: Start difference. First operand 721 states and 1044 transitions. Second operand 3 states. [2018-11-07 00:58:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:58:04,083 INFO L93 Difference]: Finished difference Result 1871 states and 2749 transitions. [2018-11-07 00:58:04,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 00:58:04,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-11-07 00:58:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:58:04,099 INFO L225 Difference]: With dead ends: 1871 [2018-11-07 00:58:04,100 INFO L226 Difference]: Without dead ends: 1156 [2018-11-07 00:58:04,104 INFO L604 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-11-07 00:58:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-11-07 00:58:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1153. [2018-11-07 00:58:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-11-07 00:58:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1553 transitions. [2018-11-07 00:58:04,153 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1553 transitions. Word has length 147 [2018-11-07 00:58:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:58:04,154 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 1553 transitions. [2018-11-07 00:58:04,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 00:58:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1553 transitions. [2018-11-07 00:58:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-07 00:58:04,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:58:04,162 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 00:58:04,162 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:58:04,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:58:04,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2123069123, now seen corresponding path program 1 times [2018-11-07 00:58:04,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:58:04,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:58:04,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:58:04,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:58:04,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:58:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:58:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 00:58:04,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:58:04,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 00:58:04,436 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:58:04,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 00:58:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 00:58:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 00:58:04,437 INFO L87 Difference]: Start difference. First operand 1153 states and 1553 transitions. Second operand 4 states. [2018-11-07 00:58:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:58:06,044 INFO L93 Difference]: Finished difference Result 3973 states and 5595 transitions. [2018-11-07 00:58:06,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 00:58:06,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-11-07 00:58:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:58:06,063 INFO L225 Difference]: With dead ends: 3973 [2018-11-07 00:58:06,064 INFO L226 Difference]: Without dead ends: 2826 [2018-11-07 00:58:06,073 INFO L604 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-11-07 00:58:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-11-07 00:58:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2796. [2018-11-07 00:58:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2018-11-07 00:58:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 3650 transitions. [2018-11-07 00:58:06,158 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 3650 transitions. Word has length 168 [2018-11-07 00:58:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:58:06,159 INFO L480 AbstractCegarLoop]: Abstraction has 2796 states and 3650 transitions. [2018-11-07 00:58:06,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 00:58:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3650 transitions. [2018-11-07 00:58:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 00:58:06,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:58:06,172 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:58:06,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:58:06,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:58:06,172 INFO L82 PathProgramCache]: Analyzing trace with hash -813161529, now seen corresponding path program 1 times [2018-11-07 00:58:06,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:58:06,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:58:06,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:58:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:58:06,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:58:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:58:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:58:06,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 00:58:06,394 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 00:58:06,395 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-11-07 00:58:06,397 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 00:58:06,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 00:58:06,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 00:58:15,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 00:58:15,208 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 00:58:15,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:58:15,220 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 00:58:18,489 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 79.83% of their original sizes. [2018-11-07 00:58:18,492 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 00:58:19,697 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-11-07 00:58:19,698 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 00:58:19,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 00:58:19,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-07 00:58:19,699 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:58:19,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 00:58:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 00:58:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 00:58:19,700 INFO L87 Difference]: Start difference. First operand 2796 states and 3650 transitions. Second operand 12 states. [2018-11-07 00:58:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:58:34,706 INFO L93 Difference]: Finished difference Result 5647 states and 7380 transitions. [2018-11-07 00:58:34,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 00:58:34,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2018-11-07 00:58:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:58:34,723 INFO L225 Difference]: With dead ends: 5647 [2018-11-07 00:58:34,724 INFO L226 Difference]: Without dead ends: 2857 [2018-11-07 00:58:34,735 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 00:58:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2018-11-07 00:58:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2857. [2018-11-07 00:58:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2857 states. [2018-11-07 00:58:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3716 transitions. [2018-11-07 00:58:34,824 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3716 transitions. Word has length 179 [2018-11-07 00:58:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:58:34,824 INFO L480 AbstractCegarLoop]: Abstraction has 2857 states and 3716 transitions. [2018-11-07 00:58:34,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 00:58:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3716 transitions. [2018-11-07 00:58:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 00:58:34,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:58:34,837 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:58:34,838 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:58:34,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:58:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1518221820, now seen corresponding path program 1 times [2018-11-07 00:58:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:58:34,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:58:34,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:58:34,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:58:34,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:58:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:58:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 00:58:35,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 00:58:35,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 00:58:35,145 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-11-07 00:58:35,146 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 00:58:35,155 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 00:58:35,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 00:58:58,472 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 00:58:58,472 INFO L272 AbstractInterpreter]: Visited 136 different actions 203 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 00:58:58,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:58:58,481 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 00:59:04,140 INFO L227 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 80.68% of their original sizes. [2018-11-07 00:59:04,141 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 00:59:12,938 INFO L415 sIntCurrentIteration]: We unified 187 AI predicates to 187 [2018-11-07 00:59:12,938 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 00:59:12,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 00:59:12,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 00:59:12,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:59:12,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 00:59:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 00:59:12,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-07 00:59:12,940 INFO L87 Difference]: Start difference. First operand 2857 states and 3716 transitions. Second operand 14 states. [2018-11-07 00:59:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:59:29,973 INFO L93 Difference]: Finished difference Result 5792 states and 7546 transitions. [2018-11-07 00:59:29,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 00:59:29,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-11-07 00:59:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:59:29,987 INFO L225 Difference]: With dead ends: 5792 [2018-11-07 00:59:29,987 INFO L226 Difference]: Without dead ends: 3002 [2018-11-07 00:59:29,999 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 74 SyntacticMatches, 101 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-11-07 00:59:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2018-11-07 00:59:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2995. [2018-11-07 00:59:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2995 states. [2018-11-07 00:59:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3864 transitions. [2018-11-07 00:59:30,086 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3864 transitions. Word has length 188 [2018-11-07 00:59:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:59:30,087 INFO L480 AbstractCegarLoop]: Abstraction has 2995 states and 3864 transitions. [2018-11-07 00:59:30,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 00:59:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3864 transitions. [2018-11-07 00:59:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 00:59:30,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:59:30,100 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-07 00:59:30,101 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:59:30,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:59:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash 241118704, now seen corresponding path program 1 times [2018-11-07 00:59:30,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:59:30,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:30,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:59:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:30,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:59:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:59:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 00:59:30,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 00:59:30,634 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 00:59:30,635 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-07 00:59:30,635 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 00:59:30,640 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 00:59:30,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 01:00:06,899 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 01:00:06,900 INFO L272 AbstractInterpreter]: Visited 136 different actions 203 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 01:00:06,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:00:06,910 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 01:00:20,205 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 81.39% of their original sizes. [2018-11-07 01:00:20,206 INFO L413 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-11-07 01:02:07,402 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 01:02:07,407 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 01:02:07,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:02:07 BoogieIcfgContainer [2018-11-07 01:02:07,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 01:02:07,408 INFO L168 Benchmark]: Toolchain (without parser) took 257312.08 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -854.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 01:02:07,409 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:02:07,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.16 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-11-07 01:02:07,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-11-07 01:02:07,412 INFO L168 Benchmark]: Boogie Preprocessor took 125.04 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:02:07,412 INFO L168 Benchmark]: RCFGBuilder took 3327.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2018-11-07 01:02:07,413 INFO L168 Benchmark]: TraceAbstraction took 253000.84 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -174.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 01:02:07,418 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.17 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 709.16 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 142.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.04 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3327.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253000.84 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -174.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 222 with TraceHistMax 4,while AbsIntCurrentIteration was generating AI predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 252.8s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 41.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 929 SDtfs, 2627 SDslu, 954 SDs, 0 SdLazy, 4100 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 419 GetRequests, 255 SyntacticMatches, 107 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2995occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 68.4s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9951318780587084 AbsIntWeakeningRatio, 0.2 AbsIntAvgWeakeningVarsNumRemoved, 1353.3247863247864 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 57 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1098 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1091 ConstructedInterpolants, 0 QuantifiedInterpolants, 733010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 200/217 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown