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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:09:42,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:09:42,204 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:09:42,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:09:42,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:09:42,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:09:42,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:09:42,222 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:09:42,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:09:42,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:09:42,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:09:42,226 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:09:42,227 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:09:42,228 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:09:42,229 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:09:42,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:09:42,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:09:42,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:09:42,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:09:42,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:09:42,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:09:42,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:09:42,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:09:42,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:09:42,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:09:42,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:09:42,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:09:42,253 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:09:42,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:09:42,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:09:42,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:09:42,255 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:09:42,258 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:09:42,258 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:09:42,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:09:42,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:09:42,260 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:09:42,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:09:42,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:09:42,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:09:42,293 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:09:42,296 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:09:42,297 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:09:42,297 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:09:42,297 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:09:42,297 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:09:42,297 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:09:42,298 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:09:42,298 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:09:42,298 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:09:42,298 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:09:42,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:09:42,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:09:42,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:09:42,300 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:09:42,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:09:42,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:09:42,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:09:42,301 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:09:42,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:09:42,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:09:42,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:09:42,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:09:42,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:09:42,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:09:42,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:09:42,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:09:42,304 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:09:42,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:09:42,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:09:42,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:09:42,305 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:09:42,305 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:09:42,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:09:42,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:09:42,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:09:42,371 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:09:42,372 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:09:42,373 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-11-07 07:09:42,439 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134e81d4e/1417f659964f41e98e63886dfc043ce3/FLAG0504aefe2 [2018-11-07 07:09:43,073 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:09:43,077 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-11-07 07:09:43,103 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134e81d4e/1417f659964f41e98e63886dfc043ce3/FLAG0504aefe2 [2018-11-07 07:09:43,118 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134e81d4e/1417f659964f41e98e63886dfc043ce3 [2018-11-07 07:09:43,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:09:43,134 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:09:43,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:09:43,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:09:43,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:09:43,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:43,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68992734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43, skipping insertion in model container [2018-11-07 07:09:43,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:43,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:09:43,238 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:09:43,696 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:09:43,709 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:09:43,845 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:09:43,863 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:09:43,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43 WrapperNode [2018-11-07 07:09:43,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:09:43,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:09:43,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:09:43,865 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:09:43,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:43,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:43,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:09:43,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:09:43,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:09:43,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:09:44,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:44,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:44,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:44,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:44,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:44,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:44,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (1/1) ... [2018-11-07 07:09:44,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:09:44,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:09:44,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:09:44,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:09:44,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (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 07:09:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:09:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:09:44,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:09:44,172 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:09:44,172 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:09:44,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:09:44,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:09:44,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:09:44,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:09:47,697 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:09:47,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:47 BoogieIcfgContainer [2018-11-07 07:09:47,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:09:47,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:09:47,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:09:47,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:09:47,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:09:43" (1/3) ... [2018-11-07 07:09:47,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a9a466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:47, skipping insertion in model container [2018-11-07 07:09:47,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:43" (2/3) ... [2018-11-07 07:09:47,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a9a466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:47, skipping insertion in model container [2018-11-07 07:09:47,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:47" (3/3) ... [2018-11-07 07:09:47,711 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label48_true-unreach-call_false-termination.c [2018-11-07 07:09:47,722 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:09:47,732 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:09:47,751 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:09:47,793 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:09:47,794 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:09:47,794 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:09:47,794 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:09:47,794 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:09:47,795 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:09:47,795 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:09:47,795 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:09:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 07:09:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 07:09:47,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:47,860 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:47,863 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:47,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash -549296008, now seen corresponding path program 1 times [2018-11-07 07:09:47,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:47,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:47,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:47,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:47,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:48,489 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:48,575 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 07:09:48,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:48,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:09:48,578 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:48,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:09:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:09:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:48,604 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 07:09:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:50,153 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 07:09:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:09:50,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-11-07 07:09:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:50,176 INFO L225 Difference]: With dead ends: 621 [2018-11-07 07:09:50,177 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 07:09:50,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 07:09:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 07:09:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 07:09:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 07:09:50,288 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 144 [2018-11-07 07:09:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:50,289 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 07:09:50,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:09:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 07:09:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 07:09:50,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:50,297 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:50,297 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:50,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash -949584507, now seen corresponding path program 1 times [2018-11-07 07:09:50,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:50,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:50,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:50,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:50,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:50,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:09:50,776 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:50,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:09:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:09:50,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:50,779 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 07:09:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:52,418 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 07:09:52,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:09:52,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-11-07 07:09:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:52,423 INFO L225 Difference]: With dead ends: 903 [2018-11-07 07:09:52,424 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 07:09:52,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 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 07:09:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 07:09:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 07:09:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 07:09:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 07:09:52,458 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 153 [2018-11-07 07:09:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:52,459 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 07:09:52,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:09:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 07:09:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 07:09:52,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:52,464 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:52,464 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:52,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:52,465 INFO L82 PathProgramCache]: Analyzing trace with hash 798568569, now seen corresponding path program 1 times [2018-11-07 07:09:52,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:52,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:52,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:52,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:52,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:53,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:53,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:09:53,022 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:53,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:09:53,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:09:53,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:53,024 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 07:09:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:54,916 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 07:09:54,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:09:54,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-11-07 07:09:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:54,925 INFO L225 Difference]: With dead ends: 901 [2018-11-07 07:09:54,926 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 07:09:54,928 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 07:09:54,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 07:09:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 07:09:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 07:09:54,963 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 159 [2018-11-07 07:09:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:54,963 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 07:09:54,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:09:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 07:09:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 07:09:54,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:54,969 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:54,969 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:54,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:54,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1751281726, now seen corresponding path program 1 times [2018-11-07 07:09:54,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:54,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:54,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:55,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:55,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:09:55,158 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:55,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:09:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:09:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:09:55,160 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 07:09:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:58,253 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 07:09:58,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:09:58,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-11-07 07:09:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:58,259 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 07:09:58,259 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 07:09:58,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:09:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 07:09:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 07:09:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 07:09:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 07:09:58,293 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 167 [2018-11-07 07:09:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:58,294 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 07:09:58,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:09:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 07:09:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 07:09:58,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:58,299 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:58,299 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:58,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash 526148798, now seen corresponding path program 1 times [2018-11-07 07:09:58,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:58,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:58,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:58,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:58,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:58,747 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 07:09:58,942 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 07:09:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:59,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:59,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:09:59,015 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:59,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:09:59,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:09:59,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:09:59,016 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 07:10:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:00,110 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 07:10:00,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:10:00,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-11-07 07:10:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:00,127 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 07:10:00,127 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 07:10:00,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:10:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 07:10:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 07:10:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 07:10:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 07:10:00,169 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 169 [2018-11-07 07:10:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:00,169 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 07:10:00,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:10:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 07:10:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-07 07:10:00,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:00,174 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:00,174 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:00,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1751938630, now seen corresponding path program 1 times [2018-11-07 07:10:00,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:00,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:00,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:00,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:00,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:10:00,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:10:00,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:10:00,510 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:10:00,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:10:00,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:10:00,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:10:00,511 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 07:10:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:02,221 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 07:10:02,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:10:02,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2018-11-07 07:10:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:02,226 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 07:10:02,227 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 07:10:02,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 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 07:10:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 07:10:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 07:10:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 07:10:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 07:10:02,254 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 171 [2018-11-07 07:10:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:02,254 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 07:10:02,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:10:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 07:10:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 07:10:02,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:02,260 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:02,260 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:02,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:02,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1260045234, now seen corresponding path program 1 times [2018-11-07 07:10:02,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:02,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:02,262 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:02,483 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:10:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:10:02,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:10:02,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:10:02,658 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:10:02,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:10:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:10:02,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:10:02,659 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 07:10:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:03,798 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 07:10:03,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:10:03,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-11-07 07:10:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:03,808 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 07:10:03,808 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 07:10:03,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:10:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 07:10:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 07:10:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 07:10:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 07:10:03,859 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 175 [2018-11-07 07:10:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:03,860 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 07:10:03,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:10:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 07:10:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 07:10:03,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:03,866 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:10:03,867 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:03,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1346398007, now seen corresponding path program 1 times [2018-11-07 07:10:03,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:03,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:03,868 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:10:04,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:04,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:04,136 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-07 07:10:04,139 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [823], [825], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:04,195 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:04,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:05,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:10:05,483 INFO L272 AbstractInterpreter]: Visited 149 different actions 441 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:10:05,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:05,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:10:05,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:05,542 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 07:10:05,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:05,559 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:10:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:05,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:10:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:10:05,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:10:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:10:06,430 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:10:06,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 07:10:06,431 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:10:06,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:10:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:10:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:10:06,432 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-11-07 07:10:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:08,300 INFO L93 Difference]: Finished difference Result 4406 states and 6474 transitions. [2018-11-07 07:10:08,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:10:08,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-11-07 07:10:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:08,310 INFO L225 Difference]: With dead ends: 4406 [2018-11-07 07:10:08,310 INFO L226 Difference]: Without dead ends: 1398 [2018-11-07 07:10:08,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 362 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:10:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2018-11-07 07:10:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1396. [2018-11-07 07:10:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2018-11-07 07:10:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1807 transitions. [2018-11-07 07:10:08,379 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1807 transitions. Word has length 181 [2018-11-07 07:10:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:08,379 INFO L480 AbstractCegarLoop]: Abstraction has 1396 states and 1807 transitions. [2018-11-07 07:10:08,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:10:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1807 transitions. [2018-11-07 07:10:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-07 07:10:08,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:08,387 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:08,387 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:08,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash 377204802, now seen corresponding path program 1 times [2018-11-07 07:10:08,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:08,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:08,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:08,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:08,389 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:10:08,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:08,982 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:08,983 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-11-07 07:10:08,984 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [823], [825], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:08,996 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:08,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:09,389 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:10:09,389 INFO L272 AbstractInterpreter]: Visited 148 different actions 290 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 07:10:09,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:09,427 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:10:09,902 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 82.89% of their original sizes. [2018-11-07 07:10:09,902 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:10:10,710 INFO L415 sIntCurrentIteration]: We unified 212 AI predicates to 212 [2018-11-07 07:10:10,711 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:10:10,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:10:10,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:10:10,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:10:10,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:10:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:10:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:10:10,713 INFO L87 Difference]: Start difference. First operand 1396 states and 1807 transitions. Second operand 10 states. [2018-11-07 07:10:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:23,591 INFO L93 Difference]: Finished difference Result 3747 states and 4838 transitions. [2018-11-07 07:10:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 07:10:23,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-11-07 07:10:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:23,601 INFO L225 Difference]: With dead ends: 3747 [2018-11-07 07:10:23,601 INFO L226 Difference]: Without dead ends: 2357 [2018-11-07 07:10:23,605 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-07 07:10:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2018-11-07 07:10:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2350. [2018-11-07 07:10:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2018-11-07 07:10:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 2908 transitions. [2018-11-07 07:10:23,664 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 2908 transitions. Word has length 213 [2018-11-07 07:10:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:23,665 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 2908 transitions. [2018-11-07 07:10:23,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:10:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 2908 transitions. [2018-11-07 07:10:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-07 07:10:23,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:23,674 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:23,675 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:23,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 626008190, now seen corresponding path program 1 times [2018-11-07 07:10:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:23,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:24,110 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 07:10:24,304 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 07:10:24,508 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 07:10:25,511 WARN L179 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-11-07 07:10:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 67 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:10:25,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:25,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:25,727 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-11-07 07:10:25,728 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [823], [825], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:25,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:25,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:26,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:10:26,092 INFO L272 AbstractInterpreter]: Visited 149 different actions 441 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:10:26,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:26,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:10:26,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:26,127 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 07:10:26,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:26,140 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:10:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:26,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:10:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:10:26,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:10:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:10:26,631 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:10:26,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2018-11-07 07:10:26,632 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:10:26,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:10:26,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:10:26,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 07:10:26,633 INFO L87 Difference]: Start difference. First operand 2350 states and 2908 transitions. Second operand 3 states. [2018-11-07 07:10:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:27,276 INFO L93 Difference]: Finished difference Result 5131 states and 6428 transitions. [2018-11-07 07:10:27,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:10:27,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-11-07 07:10:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:27,278 INFO L225 Difference]: With dead ends: 5131 [2018-11-07 07:10:27,278 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:10:27,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 456 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 07:10:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:10:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:10:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:10:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:10:27,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2018-11-07 07:10:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:27,293 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:10:27,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:10:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:10:27,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:10:27,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:10:27,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:27,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:28,323 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 75 [2018-11-07 07:10:28,430 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2018-11-07 07:10:28,612 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 39 [2018-11-07 07:10:28,615 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:10:28,615 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a25~0)| ~a25~0)) [2018-11-07 07:10:28,615 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:10:28,616 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,616 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,616 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,616 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,616 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,616 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 07:10:28,616 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 07:10:28,616 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 07:10:28,617 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 07:10:28,617 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 07:10:28,617 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 07:10:28,617 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 07:10:28,617 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 07:10:28,617 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 07:10:28,617 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 07:10:28,617 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 07:10:28,618 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 07:10:28,619 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:10:28,620 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:10:28,620 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 07:10:28,620 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,620 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,620 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,620 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,620 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,620 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:10:28,621 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 07:10:28,621 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:10:28,621 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 07:10:28,622 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 07:10:28,622 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 07:10:28,622 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 07:10:28,622 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 07:10:28,622 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 07:10:28,622 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 07:10:28,622 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 07:10:28,623 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,623 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,623 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,623 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,623 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,623 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 07:10:28,623 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 07:10:28,623 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 07:10:28,624 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 07:10:28,625 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 07:10:28,625 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,625 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,625 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,625 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,625 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,625 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 07:10:28,625 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 07:10:28,626 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 07:10:28,626 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 07:10:28,626 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 07:10:28,626 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 583) no Hoare annotation was computed. [2018-11-07 07:10:28,626 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 07:10:28,626 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 07:10:28,627 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 07:10:28,627 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 07:10:28,627 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 07:10:28,627 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 07:10:28,627 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 07:10:28,627 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 07:10:28,627 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:10:28,627 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 07:10:28,628 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:10:28,628 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,628 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,628 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,628 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,628 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,628 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 07:10:28,628 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 07:10:28,629 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 07:10:28,630 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,631 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,631 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,631 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,631 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,631 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,631 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 07:10:28,631 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 07:10:28,632 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 07:10:28,632 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 07:10:28,632 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 07:10:28,632 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 07:10:28,632 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 07:10:28,632 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 07:10:28,632 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 07:10:28,632 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 07:10:28,633 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 07:10:28,633 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,633 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,633 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,633 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,633 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,633 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,633 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 07:10:28,634 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 07:10:28,635 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 07:10:28,635 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 07:10:28,635 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 07:10:28,635 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 07:10:28,635 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,635 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,635 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,635 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,636 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse12 (= 1 |old(~a19~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse13 (= 1 |old(~a25~0)|))) (let ((.cse4 (not (= 7 |old(~a28~0)|))) (.cse5 (not .cse13)) (.cse8 (= 1 ~a11~0)) (.cse10 (= 8 ~a17~0)) (.cse9 (= 1 ~a19~0)) (.cse7 (not .cse1)) (.cse6 (not .cse12)) (.cse11 (not (= 8 |old(~a17~0)|))) (.cse0 (not (= 1 ~a21~0))) (.cse2 (= |old(~a28~0)| ~a28~0)) (.cse3 (= |old(~a25~0)| ~a25~0))) (and (or .cse0 .cse1 (and .cse2 .cse3 (not (= ~a11~0 1)))) (or .cse0 .cse4 .cse5 .cse6 .cse7 (and .cse8 (= 7 ~a17~0) .cse9) (not (= 7 |old(~a17~0)|))) (or .cse0 (< 9 |old(~a28~0)|) (and .cse2 .cse3)) (or (and .cse8 .cse10 .cse9 .cse3 (= 10 ~a28~0)) .cse0 (not (= 10 |old(~a28~0)|)) .cse5 .cse6 .cse11 .cse7) (or .cse12 .cse0 .cse4 .cse11 (and .cse8 .cse10 (not .cse9)) .cse7 .cse13) (or .cse0 .cse5 .cse6 .cse11 (and .cse8 .cse10 .cse9) (not (= 9 |old(~a28~0)|)) .cse7) (or .cse0 .cse6 (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 1)) (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) .cse11 (= |calculate_output_#in~input| 0)) (or .cse0 (and .cse2 (<= ~a17~0 7) .cse3) (< 7 |old(~a17~0)|))))) [2018-11-07 07:10:28,636 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,636 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,636 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 07:10:28,636 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 07:10:28,636 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,637 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 07:10:28,638 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 07:10:28,639 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 07:10:28,640 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 07:10:28,641 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:10:28,642 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 07:10:28,642 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:10:28,642 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:10:28,642 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 07:10:28,642 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 07:10:28,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:10:28,642 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-07 07:10:28,642 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:10:28,643 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:10:28,643 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= |old(~a25~0)| ~a25~0) (= ~a19~0 1) (= ~a28~0 7)) (not (= 0 |old(~a25~0)|))) [2018-11-07 07:10:28,643 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 07:10:28,643 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (<= ~a28~0 9) (not (= 0 |old(~a11~0)|)) (not (= ~a11~0 1)) (<= ~a17~0 7) (not (= 1 |old(~a19~0)|)) (and (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0) (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 07:10:28,643 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:10:28,643 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:10:28,644 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (<= ~a28~0 9) (not (= 0 |old(~a11~0)|)) (not (= ~a11~0 1)) (<= ~a17~0 7) (not (= 1 |old(~a19~0)|)) (and (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0) (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 07:10:28,644 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 07:10:28,644 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 07:10:28,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:10:28 BoogieIcfgContainer [2018-11-07 07:10:28,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:10:28,657 INFO L168 Benchmark]: Toolchain (without parser) took 45524.23 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 147.0 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:28,658 INFO L168 Benchmark]: CDTParser took 0.24 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 07:10:28,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:28,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:28,660 INFO L168 Benchmark]: Boogie Preprocessor took 103.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:28,661 INFO L168 Benchmark]: RCFGBuilder took 3599.87 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.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:28,662 INFO L168 Benchmark]: TraceAbstraction took 40956.93 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 464.0 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -367.2 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:28,667 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.24 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 729.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 129.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3599.87 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.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40956.93 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 464.0 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -367.2 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((!(1 == a21) || !(7 == \old(a28))) || a28 <= 9) || !(0 == \old(a11))) || !(a11 == 1)) || a17 <= 7) || !(1 == \old(a19))) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(8 == \old(a17))) || !(0 == \old(a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 40.8s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1379 SDtfs, 4837 SDslu, 965 SDs, 0 SdLazy, 6645 SolverSat, 1382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1118 GetRequests, 1044 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2350occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9979792931651976 AbsIntWeakeningRatio, 0.16981132075471697 AbsIntAvgWeakeningVarsNumRemoved, 26.349056603773583 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 49 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 84 PreInvPairs, 142 NumberOfFragments, 397 HoareAnnotationTreeSize, 84 FomulaSimplifications, 1932 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1518 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2169 NumberOfCodeBlocks, 2169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2564 ConstructedInterpolants, 0 QuantifiedInterpolants, 2339551 SizeOfPredicates, 4 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 552/598 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...