java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:45:16,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:45:16,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:45:16,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:45:16,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:45:16,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:45:16,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:45:16,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:45:16,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:45:16,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:45:16,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:45:16,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:45:16,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:45:16,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:45:16,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:45:16,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:45:16,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:45:16,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:45:16,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:45:16,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:45:16,109 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:45:16,110 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:45:16,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:45:16,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:45:16,113 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:45:16,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:45:16,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:45:16,122 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:45:16,123 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:45:16,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:45:16,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:45:16,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:45:16,128 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:45:16,128 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:45:16,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:45:16,131 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:45:16,131 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:45:16,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:45:16,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:45:16,168 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:45:16,168 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:45:16,169 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:45:16,169 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:45:16,169 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:45:16,169 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:45:16,169 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:45:16,170 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:45:16,170 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:45:16,170 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:45:16,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:45:16,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:45:16,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:45:16,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:45:16,173 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:45:16,173 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:45:16,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:45:16,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:45:16,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:45:16,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:45:16,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:45:16,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:45:16,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:45:16,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:45:16,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:45:16,176 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:45:16,176 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:45:16,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:45:16,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:45:16,176 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:45:16,177 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:45:16,177 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:45:16,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:45:16,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:45:16,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:45:16,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:45:16,265 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:45:16,265 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 12:45:16,339 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d148180/d4cba8d863a04548b6a79a437523eb78/FLAG1189d4c57 [2018-11-07 12:45:16,885 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:45:16,886 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-11-07 12:45:16,903 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d148180/d4cba8d863a04548b6a79a437523eb78/FLAG1189d4c57 [2018-11-07 12:45:16,918 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d148180/d4cba8d863a04548b6a79a437523eb78 [2018-11-07 12:45:16,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:45:16,932 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:45:16,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:45:16,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:45:16,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:45:16,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:45:16" (1/1) ... [2018-11-07 12:45:16,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673adebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:16, skipping insertion in model container [2018-11-07 12:45:16,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:45:16" (1/1) ... [2018-11-07 12:45:16,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:45:17,027 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:45:17,523 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:45:17,530 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:45:17,689 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:45:17,711 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:45:17,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17 WrapperNode [2018-11-07 12:45:17,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:45:17,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:45:17,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:45:17,714 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:45:17,725 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:45:17" (1/1) ... [2018-11-07 12:45:17,850 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:45:17" (1/1) ... [2018-11-07 12:45:17,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:45:17,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:45:17,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:45:17,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:45:17,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (1/1) ... [2018-11-07 12:45:17,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (1/1) ... [2018-11-07 12:45:17,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (1/1) ... [2018-11-07 12:45:17,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (1/1) ... [2018-11-07 12:45:17,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (1/1) ... [2018-11-07 12:45:17,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (1/1) ... [2018-11-07 12:45:17,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (1/1) ... [2018-11-07 12:45:17,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:45:17,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:45:17,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:45:17,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:45:17,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (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 12:45:18,080 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:45:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:45:18,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:45:18,081 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:45:18,081 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:45:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:45:18,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:45:18,082 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:45:18,082 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:45:21,426 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:45:21,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:45:21 BoogieIcfgContainer [2018-11-07 12:45:21,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:45:21,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:45:21,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:45:21,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:45:21,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:45:16" (1/3) ... [2018-11-07 12:45:21,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4532e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:45:21, skipping insertion in model container [2018-11-07 12:45:21,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:17" (2/3) ... [2018-11-07 12:45:21,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4532e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:45:21, skipping insertion in model container [2018-11-07 12:45:21,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:45:21" (3/3) ... [2018-11-07 12:45:21,436 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label06_true-unreach-call_false-termination.c [2018-11-07 12:45:21,447 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:45:21,456 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:45:21,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:45:21,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:45:21,515 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:45:21,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:45:21,515 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:45:21,515 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:45:21,516 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:45:21,516 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:45:21,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:45:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:45:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 12:45:21,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:21,576 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 12:45:21,579 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:21,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:21,587 INFO L82 PathProgramCache]: Analyzing trace with hash 482475453, now seen corresponding path program 1 times [2018-11-07 12:45:21,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:21,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:21,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:22,328 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:45:22,481 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 12:45:22,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:22,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:45:22,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:22,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:45:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:45:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:45:22,510 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:45:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:24,365 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:45:24,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:45:24,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-07 12:45:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:24,386 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:45:24,387 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:45:24,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:45:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:45:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:45:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:45:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-11-07 12:45:24,473 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 131 [2018-11-07 12:45:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:24,475 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-11-07 12:45:24,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:45:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-11-07 12:45:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 12:45:24,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:24,483 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 12:45:24,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:24,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:24,484 INFO L82 PathProgramCache]: Analyzing trace with hash -359292034, now seen corresponding path program 1 times [2018-11-07 12:45:24,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:24,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:24,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:24,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:24,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:24,733 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 12:45:24,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:24,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:45:24,734 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:24,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:45:24,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:45:24,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:45:24,737 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-11-07 12:45:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:26,891 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-11-07 12:45:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:45:26,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-11-07 12:45:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:26,904 INFO L225 Difference]: With dead ends: 1075 [2018-11-07 12:45:26,905 INFO L226 Difference]: Without dead ends: 741 [2018-11-07 12:45:26,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:45:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-07 12:45:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-07 12:45:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-07 12:45:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-11-07 12:45:26,985 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 142 [2018-11-07 12:45:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:26,986 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-11-07 12:45:26,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:45:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-11-07 12:45:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 12:45:26,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:26,996 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 12:45:26,996 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:26,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash -879449942, now seen corresponding path program 1 times [2018-11-07 12:45:26,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:26,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:26,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:26,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:26,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:27,497 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 12:45:27,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:27,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:45:27,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:27,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:45:27,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:45:27,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:45:27,500 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 5 states. [2018-11-07 12:45:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:29,835 INFO L93 Difference]: Finished difference Result 1578 states and 2483 transitions. [2018-11-07 12:45:29,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:45:29,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 12:45:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:29,841 INFO L225 Difference]: With dead ends: 1578 [2018-11-07 12:45:29,842 INFO L226 Difference]: Without dead ends: 721 [2018-11-07 12:45:29,848 INFO L604 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-11-07 12:45:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-07 12:45:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-07 12:45:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-07 12:45:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1044 transitions. [2018-11-07 12:45:29,887 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1044 transitions. Word has length 143 [2018-11-07 12:45:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:29,887 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 1044 transitions. [2018-11-07 12:45:29,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:45:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1044 transitions. [2018-11-07 12:45:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 12:45:29,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:29,892 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 12:45:29,892 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:29,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:29,895 INFO L82 PathProgramCache]: Analyzing trace with hash 353210034, now seen corresponding path program 1 times [2018-11-07 12:45:29,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:29,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:29,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:29,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:29,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:30,099 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 12:45:30,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:30,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:45:30,100 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:30,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:45:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:45:30,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:45:30,101 INFO L87 Difference]: Start difference. First operand 721 states and 1044 transitions. Second operand 3 states. [2018-11-07 12:45:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:31,680 INFO L93 Difference]: Finished difference Result 1871 states and 2749 transitions. [2018-11-07 12:45:31,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:45:31,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-11-07 12:45:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:31,691 INFO L225 Difference]: With dead ends: 1871 [2018-11-07 12:45:31,691 INFO L226 Difference]: Without dead ends: 1156 [2018-11-07 12:45:31,696 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 12:45:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-11-07 12:45:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1153. [2018-11-07 12:45:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-11-07 12:45:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1553 transitions. [2018-11-07 12:45:31,745 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1553 transitions. Word has length 147 [2018-11-07 12:45:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:31,746 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 1553 transitions. [2018-11-07 12:45:31,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:45:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1553 transitions. [2018-11-07 12:45:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-07 12:45:31,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:31,753 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 12:45:31,753 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:31,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2123069123, now seen corresponding path program 1 times [2018-11-07 12:45:31,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:31,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:31,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:31,959 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 12:45:31,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:45:31,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 12:45:31,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:31,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 12:45:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 12:45:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 12:45:31,961 INFO L87 Difference]: Start difference. First operand 1153 states and 1553 transitions. Second operand 4 states. [2018-11-07 12:45:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:33,011 INFO L93 Difference]: Finished difference Result 3973 states and 5595 transitions. [2018-11-07 12:45:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:45:33,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-11-07 12:45:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:33,035 INFO L225 Difference]: With dead ends: 3973 [2018-11-07 12:45:33,035 INFO L226 Difference]: Without dead ends: 2826 [2018-11-07 12:45:33,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 12:45:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-11-07 12:45:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2796. [2018-11-07 12:45:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2018-11-07 12:45:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 3650 transitions. [2018-11-07 12:45:33,141 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 3650 transitions. Word has length 168 [2018-11-07 12:45:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:33,142 INFO L480 AbstractCegarLoop]: Abstraction has 2796 states and 3650 transitions. [2018-11-07 12:45:33,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 12:45:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3650 transitions. [2018-11-07 12:45:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 12:45:33,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:33,156 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 12:45:33,156 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:33,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash -813161529, now seen corresponding path program 1 times [2018-11-07 12:45:33,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:33,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:33,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:33,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:33,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:33,579 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 12:45:33,663 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 12:45:33,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:45:33,664 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:45:33,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-11-07 12:45:33,667 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 12:45:33,719 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:45:33,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:45:36,485 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:45:36,488 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 12:45:36,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:36,533 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:45:39,533 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 79.64% of their original sizes. [2018-11-07 12:45:39,536 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:45:39,992 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-11-07 12:45:39,992 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:45:39,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:45:39,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-07 12:45:39,994 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:39,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:45:39,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:45:39,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 12:45:39,995 INFO L87 Difference]: Start difference. First operand 2796 states and 3650 transitions. Second operand 12 states. [2018-11-07 12:45:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:45:51,776 INFO L93 Difference]: Finished difference Result 5647 states and 7380 transitions. [2018-11-07 12:45:51,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 12:45:51,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2018-11-07 12:45:51,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:45:51,791 INFO L225 Difference]: With dead ends: 5647 [2018-11-07 12:45:51,791 INFO L226 Difference]: Without dead ends: 2857 [2018-11-07 12:45:51,802 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:45:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2018-11-07 12:45:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2857. [2018-11-07 12:45:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2857 states. [2018-11-07 12:45:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3716 transitions. [2018-11-07 12:45:51,881 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3716 transitions. Word has length 179 [2018-11-07 12:45:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:45:51,881 INFO L480 AbstractCegarLoop]: Abstraction has 2857 states and 3716 transitions. [2018-11-07 12:45:51,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:45:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3716 transitions. [2018-11-07 12:45:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 12:45:51,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:45:51,894 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 12:45:51,895 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:45:51,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1518221820, now seen corresponding path program 1 times [2018-11-07 12:45:51,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:45:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:51,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:45:51,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:45:51,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:45:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:45:52,128 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 12:45:52,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:45:52,129 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:45:52,129 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-11-07 12:45:52,130 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 12:45:52,136 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:45:52,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:45:54,639 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:45:54,639 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 12:45:54,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:45:54,678 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:45:56,509 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 81.37% of their original sizes. [2018-11-07 12:45:56,510 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:45:57,260 INFO L415 sIntCurrentIteration]: We unified 187 AI predicates to 187 [2018-11-07 12:45:57,260 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:45:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:45:57,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 12:45:57,261 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:45:57,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 12:45:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 12:45:57,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:45:57,262 INFO L87 Difference]: Start difference. First operand 2857 states and 3716 transitions. Second operand 19 states. [2018-11-07 12:46:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:17,259 INFO L93 Difference]: Finished difference Result 5932 states and 7727 transitions. [2018-11-07 12:46:17,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:46:17,259 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 188 [2018-11-07 12:46:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:17,274 INFO L225 Difference]: With dead ends: 5932 [2018-11-07 12:46:17,274 INFO L226 Difference]: Without dead ends: 3142 [2018-11-07 12:46:17,284 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 199 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:46:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2018-11-07 12:46:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3131. [2018-11-07 12:46:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2018-11-07 12:46:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4010 transitions. [2018-11-07 12:46:17,365 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4010 transitions. Word has length 188 [2018-11-07 12:46:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:17,365 INFO L480 AbstractCegarLoop]: Abstraction has 3131 states and 4010 transitions. [2018-11-07 12:46:17,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 12:46:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4010 transitions. [2018-11-07 12:46:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-07 12:46:17,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:17,378 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 12:46:17,379 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:17,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash 241118704, now seen corresponding path program 1 times [2018-11-07 12:46:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:17,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:17,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:17,882 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 12:46:18,071 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 12:46:18,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:46:18,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:46:18,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-07 12:46:18,073 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 12:46:18,078 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:46:18,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:46:21,004 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:46:21,004 INFO L272 AbstractInterpreter]: Visited 136 different actions 205 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:46:21,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:21,012 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:46:24,396 INFO L227 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 81.15% of their original sizes. [2018-11-07 12:46:24,396 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:46:25,707 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-11-07 12:46:25,707 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:46:25,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:46:25,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-07 12:46:25,708 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:46:25,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 12:46:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 12:46:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-07 12:46:25,709 INFO L87 Difference]: Start difference. First operand 3131 states and 4010 transitions. Second operand 25 states. [2018-11-07 12:46:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:46:57,962 INFO L93 Difference]: Finished difference Result 6341 states and 8150 transitions. [2018-11-07 12:46:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 12:46:57,962 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 221 [2018-11-07 12:46:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:46:57,976 INFO L225 Difference]: With dead ends: 6341 [2018-11-07 12:46:57,977 INFO L226 Difference]: Without dead ends: 3551 [2018-11-07 12:46:57,987 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 191 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 12:46:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2018-11-07 12:46:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3269. [2018-11-07 12:46:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2018-11-07 12:46:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4152 transitions. [2018-11-07 12:46:58,070 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4152 transitions. Word has length 221 [2018-11-07 12:46:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:46:58,070 INFO L480 AbstractCegarLoop]: Abstraction has 3269 states and 4152 transitions. [2018-11-07 12:46:58,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 12:46:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4152 transitions. [2018-11-07 12:46:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 12:46:58,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:46:58,084 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2018-11-07 12:46:58,084 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:46:58,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:46:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1707455469, now seen corresponding path program 1 times [2018-11-07 12:46:58,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:46:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:58,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:46:58,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:46:58,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:46:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:46:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:46:58,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:46:58,297 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:46:58,297 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-07 12:46:58,298 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], [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 12:46:58,301 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:46:58,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:03,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:47:03,162 INFO L272 AbstractInterpreter]: Visited 138 different actions 630 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:47:03,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:03,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:47:03,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:03,176 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:47:03,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:03,191 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:47:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:03,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:47:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 12:47:03,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:47:03,828 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:47:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:47:04,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:47:04,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 12:47:04,213 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:47:04,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:47:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:47:04,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:47:04,215 INFO L87 Difference]: Start difference. First operand 3269 states and 4152 transitions. Second operand 11 states. [2018-11-07 12:47:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:07,167 INFO L93 Difference]: Finished difference Result 7339 states and 9446 transitions. [2018-11-07 12:47:07,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 12:47:07,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2018-11-07 12:47:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:07,187 INFO L225 Difference]: With dead ends: 7339 [2018-11-07 12:47:07,187 INFO L226 Difference]: Without dead ends: 4275 [2018-11-07 12:47:07,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:47:07,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2018-11-07 12:47:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3997. [2018-11-07 12:47:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3997 states. [2018-11-07 12:47:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5037 transitions. [2018-11-07 12:47:07,330 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5037 transitions. Word has length 230 [2018-11-07 12:47:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:07,330 INFO L480 AbstractCegarLoop]: Abstraction has 3997 states and 5037 transitions. [2018-11-07 12:47:07,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:47:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5037 transitions. [2018-11-07 12:47:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-07 12:47:07,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:07,348 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2018-11-07 12:47:07,348 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:07,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1435666309, now seen corresponding path program 1 times [2018-11-07 12:47:07,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:07,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:07,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:47:07,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:07,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:47:07,730 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2018-11-07 12:47:07,731 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], [173], [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 12:47:07,735 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:47:07,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:12,289 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:47:12,289 INFO L272 AbstractInterpreter]: Visited 137 different actions 340 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 12:47:12,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:12,295 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:47:13,611 INFO L227 lantSequenceWeakener]: Weakened 236 states. On average, predicates are now at 80.47% of their original sizes. [2018-11-07 12:47:13,611 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:47:13,698 INFO L415 sIntCurrentIteration]: We unified 238 AI predicates to 238 [2018-11-07 12:47:13,698 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:47:13,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:47:13,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:47:13,699 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:13,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:47:13,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:47:13,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:47:13,700 INFO L87 Difference]: Start difference. First operand 3997 states and 5037 transitions. Second operand 11 states. [2018-11-07 12:47:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:24,726 INFO L93 Difference]: Finished difference Result 7793 states and 9893 transitions. [2018-11-07 12:47:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:47:24,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 239 [2018-11-07 12:47:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:24,744 INFO L225 Difference]: With dead ends: 7793 [2018-11-07 12:47:24,744 INFO L226 Difference]: Without dead ends: 4139 [2018-11-07 12:47:24,755 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 247 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:47:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2018-11-07 12:47:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 4135. [2018-11-07 12:47:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4135 states. [2018-11-07 12:47:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4135 states to 4135 states and 5186 transitions. [2018-11-07 12:47:24,852 INFO L78 Accepts]: Start accepts. Automaton has 4135 states and 5186 transitions. Word has length 239 [2018-11-07 12:47:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:24,853 INFO L480 AbstractCegarLoop]: Abstraction has 4135 states and 5186 transitions. [2018-11-07 12:47:24,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:47:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4135 states and 5186 transitions. [2018-11-07 12:47:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-07 12:47:24,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:24,869 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, 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] [2018-11-07 12:47:24,869 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:24,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1728962788, now seen corresponding path program 1 times [2018-11-07 12:47:24,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:24,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:24,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:24,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:25,390 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 12:47:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 122 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:47:25,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:25,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:47:25,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-11-07 12:47:25,570 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], [225], [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 12:47:25,573 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:47:25,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:27,539 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:47:27,539 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 12:47:27,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:27,548 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:47:29,418 INFO L227 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 80.37% of their original sizes. [2018-11-07 12:47:29,419 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:47:29,696 INFO L415 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2018-11-07 12:47:29,696 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:47:29,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:47:29,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:47:29,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:29,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:47:29,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:47:29,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:47:29,698 INFO L87 Difference]: Start difference. First operand 4135 states and 5186 transitions. Second operand 18 states. [2018-11-07 12:47:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:47:51,290 INFO L93 Difference]: Finished difference Result 7928 states and 10032 transitions. [2018-11-07 12:47:51,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:47:51,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 243 [2018-11-07 12:47:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:47:51,305 INFO L225 Difference]: With dead ends: 7928 [2018-11-07 12:47:51,306 INFO L226 Difference]: Without dead ends: 4274 [2018-11-07 12:47:51,317 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-11-07 12:47:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2018-11-07 12:47:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 4273. [2018-11-07 12:47:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4273 states. [2018-11-07 12:47:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5331 transitions. [2018-11-07 12:47:51,429 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5331 transitions. Word has length 243 [2018-11-07 12:47:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:47:51,429 INFO L480 AbstractCegarLoop]: Abstraction has 4273 states and 5331 transitions. [2018-11-07 12:47:51,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:47:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5331 transitions. [2018-11-07 12:47:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-07 12:47:51,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:47:51,448 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 12:47:51,448 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:47:51,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2138785201, now seen corresponding path program 1 times [2018-11-07 12:47:51,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:47:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:47:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:47:51,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:47:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:47:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 120 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:47:52,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:47:52,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:47:52,141 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-11-07 12:47:52,141 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], [225], [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 12:47:52,144 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:47:52,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:47:55,568 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:47:55,568 INFO L272 AbstractInterpreter]: Visited 137 different actions 345 times. Merged at 7 different actions 19 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:47:55,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:47:55,594 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:47:56,762 INFO L227 lantSequenceWeakener]: Weakened 249 states. On average, predicates are now at 80.45% of their original sizes. [2018-11-07 12:47:56,762 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:47:56,866 INFO L415 sIntCurrentIteration]: We unified 251 AI predicates to 251 [2018-11-07 12:47:56,866 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:47:56,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:47:56,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-07 12:47:56,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:47:56,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:47:56,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:47:56,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:47:56,868 INFO L87 Difference]: Start difference. First operand 4273 states and 5331 transitions. Second operand 11 states. [2018-11-07 12:48:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:07,600 INFO L93 Difference]: Finished difference Result 8771 states and 10998 transitions. [2018-11-07 12:48:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:48:07,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 252 [2018-11-07 12:48:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:07,616 INFO L225 Difference]: With dead ends: 8771 [2018-11-07 12:48:07,616 INFO L226 Difference]: Without dead ends: 4979 [2018-11-07 12:48:07,626 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 261 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-07 12:48:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4979 states. [2018-11-07 12:48:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4979 to 4962. [2018-11-07 12:48:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4962 states. [2018-11-07 12:48:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 6077 transitions. [2018-11-07 12:48:07,734 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 6077 transitions. Word has length 252 [2018-11-07 12:48:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:07,735 INFO L480 AbstractCegarLoop]: Abstraction has 4962 states and 6077 transitions. [2018-11-07 12:48:07,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:48:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 6077 transitions. [2018-11-07 12:48:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-07 12:48:07,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:07,755 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-07 12:48:07,755 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:07,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash 927990217, now seen corresponding path program 1 times [2018-11-07 12:48:07,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:07,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:07,757 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 175 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:48:08,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:08,404 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:48:08,404 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-07 12:48:08,405 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], [105], [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 12:48:08,407 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:48:08,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:48:23,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:48:23,472 INFO L272 AbstractInterpreter]: Visited 138 different actions 3284 times. Merged at 9 different actions 291 times. Widened at 1 different actions 21 times. Found 67 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:48:23,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:23,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:48:23,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:48:23,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:48:23,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:23,492 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:48:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:23,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:48:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 12:48:23,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:48:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 12:48:24,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:48:24,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-07 12:48:24,134 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:48:24,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:48:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:48:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-07 12:48:24,137 INFO L87 Difference]: Start difference. First operand 4962 states and 6077 transitions. Second operand 11 states. [2018-11-07 12:48:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:48:29,167 INFO L93 Difference]: Finished difference Result 10939 states and 15095 transitions. [2018-11-07 12:48:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 12:48:29,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 255 [2018-11-07 12:48:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:48:29,168 INFO L225 Difference]: With dead ends: 10939 [2018-11-07 12:48:29,168 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:48:29,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 528 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 12:48:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:48:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:48:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:48:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:48:29,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2018-11-07 12:48:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:48:29,214 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:48:29,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:48:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:48:29,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:48:29,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:48:29,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:48:29,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:48:29,910 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 158 [2018-11-07 12:48:30,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:48:30,343 WARN L179 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 172 [2018-11-07 12:48:30,567 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-11-07 12:48:32,112 WARN L179 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 140 DAG size of output: 86 [2018-11-07 12:48:38,763 WARN L179 SmtUtils]: Spent 6.63 s on a formula simplification. DAG size of input: 314 DAG size of output: 178 [2018-11-07 12:48:39,009 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-07 12:48:40,975 WARN L179 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 190 DAG size of output: 103 [2018-11-07 12:48:41,441 WARN L179 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 103 [2018-11-07 12:48:41,444 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:48:41,444 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a20~0)| ~a20~0) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-07 12:48:41,444 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:48:41,444 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:48:41,444 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:48:41,445 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,445 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,445 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,445 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,445 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,445 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,445 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:48:41,445 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,446 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:48:41,447 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,448 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:48:41,449 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:48:41,450 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:48:41,451 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:48:41,452 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,453 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:48:41,454 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:48:41,455 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:48:41,456 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:48:41,457 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:48:41,457 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:48:41,457 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:48:41,457 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse20 (not (= 1 |old(~a20~0)|))) (.cse8 (< 1 |old(~a17~0)|)) (.cse1 (not (= 0 |old(~a7~0)|))) (.cse2 (not (= 1 |old(~a21~0)|))) (.cse9 (not (= 15 |old(~a8~0)|))) (.cse26 (not (= 0 |old(~a20~0)|))) (.cse27 (not (= 5 |old(~a16~0)|))) (.cse7 (not (= 8 ~a12~0))) (.cse29 (not (= 1 |old(~a17~0)|))) (.cse30 (= ~a7~0 |old(~a7~0)|)) (.cse31 (= |old(~a20~0)| ~a20~0)) (.cse32 (<= ~a21~0 |old(~a21~0)|)) (.cse28 (= |old(~a16~0)| ~a16~0)) (.cse22 (not (= ~a8~0 13)))) (let ((.cse10 (< |old(~a17~0)| 0)) (.cse4 (<= 0 ~a17~0)) (.cse6 (<= ~a17~0 1)) (.cse15 (< 0 |old(~a21~0)|)) (.cse13 (= 6 |old(~a16~0)|)) (.cse25 (and .cse30 .cse31 .cse32 .cse28 .cse22)) (.cse18 (and (or .cse1 .cse2 .cse20 .cse9 (< 5 |old(~a16~0)|) (< |old(~a16~0)| 4) .cse7 .cse8) (or .cse1 .cse2 .cse9 .cse26 .cse27 .cse7 .cse29))) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse17 (not (= 0 |old(~a17~0)|))) (.cse19 (= ~a17~0 0)) (.cse24 (= ~a17~0 1)) (.cse5 (= ~a21~0 1)) (.cse12 (< |calculate_output_#in~input| 1)) (.cse3 (not (= 4 |old(~a16~0)|))) (.cse23 (= 13 |old(~a8~0)|)) (.cse14 (and .cse30 .cse31 .cse32 .cse28)) (.cse16 (= 15 ~a8~0)) (.cse21 (= 1 |old(~a7~0)|)) (.cse11 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6) .cse7 .cse8 (< |old(~a20~0)| 0) .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 .cse7 .cse15 .cse11) (or .cse13 .cse9 .cse7 .cse16 .cse11) (or .cse0 .cse17 .cse18 .cse19 .cse12) (or (or .cse1 .cse2 (< 6 |old(~a16~0)|) (< |old(~a16~0)| 5) .cse20 .cse9 .cse17 .cse7) (and .cse5 .cse19)) (or .cse21 .cse20 .cse22 .cse23 .cse7) (or (or .cse21 .cse20 .cse9 .cse7) .cse16) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) .cse24 (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse12 .cse1 .cse0 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or .cse13 .cse20 .cse9 .cse16 .cse7) (or .cse0 .cse18 .cse10 (and .cse4 .cse6 .cse5) .cse12) (or .cse20 .cse7 .cse14 .cse15) (or .cse13 .cse20 .cse23 .cse7 .cse25) (or .cse21 .cse3 .cse7 .cse14 .cse11) (or .cse13 .cse25 .cse23 .cse7 .cse11) (or .cse0 .cse24 .cse18 .cse11 .cse12) (or .cse0 (or .cse1 .cse2 .cse9 .cse17 .cse26 .cse27 .cse7) (or (and .cse19 .cse5) (and .cse24 .cse5)) .cse12) (or .cse2 .cse20 .cse3 (and (= 1 ~a7~0) (= 1 ~a20~0) (= 13 ~a8~0) .cse28 (= 1 ~a21~0) (= 1 ~a17~0)) .cse7 (not .cse21) (not .cse23) .cse29) (or .cse21 .cse20 .cse14 .cse7) (or (and .cse30 .cse31 .cse32 .cse28 .cse16) .cse21 .cse9 .cse7 .cse11)))) [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,458 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:48:41,459 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:48:41,460 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:48:41,461 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:48:41,462 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:48:41,463 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:48:41,463 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:48:41,463 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:48:41,463 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:48:41,463 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:48:41,463 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:48:41,463 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= 15 ~a8~0) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:48:41,463 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:48:41,463 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:48:41,464 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (and (= ~a21~0 1) (= ~a17~0 1) (= 15 ~a8~0) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:48:41,464 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:48:41,464 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (<= ~a20~0 0)) (.cse3 (<= ~a21~0 0)) (.cse5 (= 1 ~a20~0)) (.cse0 (not (= ~a16~0 6))) (.cse2 (not (= ~a8~0 13))) (.cse4 (not (= ~a7~0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (and .cse4 (= 15 ~a8~0) .cse1) (not (= ~y~0 25)) (and .cse4 (= ~a16~0 4) .cse1) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 21 ~u~0)) (and .cse3 .cse5) (not (= 22 ~v~0)) (and .cse5 .cse0 .cse2) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse4 (= |old(~a20~0)| ~a20~0)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-07 12:48:41,464 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:48:41,464 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:48:41,464 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:48:41,464 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (<= ~a20~0 0)) (.cse3 (<= ~a21~0 0)) (.cse5 (= 1 ~a20~0)) (.cse0 (not (= ~a16~0 6))) (.cse2 (not (= ~a8~0 13))) (.cse4 (not (= ~a7~0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (and .cse4 (= 15 ~a8~0) .cse1) (not (= ~y~0 25)) (and .cse4 (= ~a16~0 4) .cse1) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 21 ~u~0)) (and .cse3 .cse5) (not (= 22 ~v~0)) (and .cse5 .cse0 .cse2) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse4 (= |old(~a20~0)| ~a20~0)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-07 12:48:41,464 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:48:41,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:48:41 BoogieIcfgContainer [2018-11-07 12:48:41,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:48:41,478 INFO L168 Benchmark]: Toolchain (without parser) took 204547.55 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 960.7 MB in the end (delta: 477.4 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 12:48:41,480 INFO L168 Benchmark]: CDTParser took 0.22 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 12:48:41,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.07 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:48:41,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:48:41,485 INFO L168 Benchmark]: Boogie Preprocessor took 128.71 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 12:48:41,485 INFO L168 Benchmark]: RCFGBuilder took 3439.19 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: 103.6 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2018-11-07 12:48:41,488 INFO L168 Benchmark]: TraceAbstraction took 200049.50 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 960.7 MB in the end (delta: 1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 12:48:41,496 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.07 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 145.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.71 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 3439.19 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: 103.6 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 200049.50 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 960.7 MB in the end (delta: 1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(a16 == 6) && a20 <= 0) && !(a8 == 13)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || !(\old(a21) == 1)) || !(b == 2)) || ((!(a7 == 1) && 15 == a8) && a20 <= 0)) || !(y == 25)) || ((!(a7 == 1) && a16 == 4) && a20 <= 0)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || (((1 == a20 && 4 == a16) && 1 == a21) && 1 == a17)) || !(21 == u)) || (a21 <= 0 && 1 == a20)) || !(22 == v)) || ((1 == a20 && !(a16 == 6)) && !(a8 == 13))) || !(z == 26)) || !(\old(a16) == 5)) || (!(a7 == 1) && \old(a20) == a20)) || !(0 == \old(a7))) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 199.9s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 124.7s AutomataDifference, 0.0s DeadEndRemovalTime, 12.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1889 SDtfs, 9872 SDslu, 2778 SDs, 0 SdLazy, 16512 SolverSat, 1883 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.9s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 2464 GetRequests, 2228 SyntacticMatches, 17 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4962occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 38.3s AbstIntTime, 8 AbstIntIterations, 6 AbstIntStrong, 0.9974505229882418 AbsIntWeakeningRatio, 0.19148936170212766 AbsIntAvgWeakeningVarsNumRemoved, 24.682370820668694 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 643 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 351 PreInvPairs, 637 NumberOfFragments, 1304 HoareAnnotationTreeSize, 351 FomulaSimplifications, 19078 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5559 FormulaSimplificationTreeSizeReductionInter, 11.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 3023 NumberOfCodeBlocks, 3023 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3491 ConstructedInterpolants, 0 QuantifiedInterpolants, 1996918 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1255 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 1943/2224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...