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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label24_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 16:03:39,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 16:03:39,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 16:03:39,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 16:03:39,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 16:03:39,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 16:03:39,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 16:03:39,925 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 16:03:39,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 16:03:39,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 16:03:39,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 16:03:39,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 16:03:39,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 16:03:39,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 16:03:39,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 16:03:39,948 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 16:03:39,949 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 16:03:39,951 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 16:03:39,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 16:03:39,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 16:03:39,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 16:03:39,964 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 16:03:39,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 16:03:39,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 16:03:39,966 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 16:03:39,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 16:03:39,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 16:03:39,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 16:03:39,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 16:03:39,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 16:03:39,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 16:03:39,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 16:03:39,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 16:03:39,972 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 16:03:39,973 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 16:03:39,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 16:03:39,974 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 16:03:39,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 16:03:39,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 16:03:39,999 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 16:03:39,999 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 16:03:39,999 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 16:03:40,000 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 16:03:40,000 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 16:03:40,001 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 16:03:40,001 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 16:03:40,001 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 16:03:40,001 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 16:03:40,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 16:03:40,003 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 16:03:40,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 16:03:40,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 16:03:40,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 16:03:40,003 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 16:03:40,003 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 16:03:40,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 16:03:40,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 16:03:40,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 16:03:40,006 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 16:03:40,006 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 16:03:40,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 16:03:40,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 16:03:40,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 16:03:40,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 16:03:40,007 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 16:03:40,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 16:03:40,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 16:03:40,008 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 16:03:40,008 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 16:03:40,009 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 16:03:40,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 16:03:40,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 16:03:40,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 16:03:40,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 16:03:40,096 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 16:03:40,097 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label24_true-unreach-call.c [2018-09-14 16:03:40,469 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62822a4b6/fcabccd760264500a079ee302f24aa6a/FLAG496caddc3 [2018-09-14 16:03:40,840 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 16:03:40,841 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label24_true-unreach-call.c [2018-09-14 16:03:40,866 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62822a4b6/fcabccd760264500a079ee302f24aa6a/FLAG496caddc3 [2018-09-14 16:03:40,889 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62822a4b6/fcabccd760264500a079ee302f24aa6a [2018-09-14 16:03:40,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 16:03:40,905 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 16:03:40,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 16:03:40,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 16:03:40,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 16:03:40,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 04:03:40" (1/1) ... [2018-09-14 16:03:40,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8699f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:40, skipping insertion in model container [2018-09-14 16:03:40,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 04:03:40" (1/1) ... [2018-09-14 16:03:40,933 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 16:03:41,756 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 16:03:41,775 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 16:03:42,036 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 16:03:42,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42 WrapperNode [2018-09-14 16:03:42,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 16:03:42,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 16:03:42,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 16:03:42,118 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 16:03:42,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 16:03:42,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 16:03:42,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 16:03:42,292 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 16:03:42,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (1/1) ... [2018-09-14 16:03:42,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 16:03:42,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 16:03:42,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 16:03:42,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 16:03:42,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (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-09-14 16:03:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 16:03:42,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 16:03:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 16:03:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 16:03:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 16:03:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 16:03:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 16:03:42,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 16:03:47,537 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 16:03:47,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 04:03:47 BoogieIcfgContainer [2018-09-14 16:03:47,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 16:03:47,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 16:03:47,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 16:03:47,548 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 16:03:47,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 04:03:40" (1/3) ... [2018-09-14 16:03:47,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b9fb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 04:03:47, skipping insertion in model container [2018-09-14 16:03:47,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:03:42" (2/3) ... [2018-09-14 16:03:47,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b9fb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 04:03:47, skipping insertion in model container [2018-09-14 16:03:47,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 04:03:47" (3/3) ... [2018-09-14 16:03:47,556 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label24_true-unreach-call.c [2018-09-14 16:03:47,566 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 16:03:47,576 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 16:03:47,650 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 16:03:47,651 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 16:03:47,651 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 16:03:47,652 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 16:03:47,652 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 16:03:47,652 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 16:03:47,652 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 16:03:47,652 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 16:03:47,652 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 16:03:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-14 16:03:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-14 16:03:47,725 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:03:47,726 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:03:47,727 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:03:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2097974209, now seen corresponding path program 1 times [2018-09-14 16:03:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:03:47,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:47,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:03:47,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:47,791 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:03:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:03:48,648 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:03:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:03:48,819 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:03:48,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 16:03:48,819 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:03:48,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 16:03:48,846 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 16:03:48,847 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:03:48,850 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-09-14 16:03:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:03:51,219 INFO L93 Difference]: Finished difference Result 844 states and 1489 transitions. [2018-09-14 16:03:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:03:51,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-09-14 16:03:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:03:51,246 INFO L225 Difference]: With dead ends: 844 [2018-09-14 16:03:51,247 INFO L226 Difference]: Without dead ends: 530 [2018-09-14 16:03:51,254 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-09-14 16:03:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-09-14 16:03:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 525. [2018-09-14 16:03:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-09-14 16:03:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 865 transitions. [2018-09-14 16:03:51,353 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 865 transitions. Word has length 198 [2018-09-14 16:03:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:03:51,355 INFO L480 AbstractCegarLoop]: Abstraction has 525 states and 865 transitions. [2018-09-14 16:03:51,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:03:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 865 transitions. [2018-09-14 16:03:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-14 16:03:51,363 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:03:51,364 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:03:51,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:03:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash -901742011, now seen corresponding path program 1 times [2018-09-14 16:03:51,365 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:03:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:03:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:51,367 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:03:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:03:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:03:51,959 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:03:51,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 16:03:51,960 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:03:51,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 16:03:51,964 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 16:03:51,965 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:03:51,965 INFO L87 Difference]: Start difference. First operand 525 states and 865 transitions. Second operand 3 states. [2018-09-14 16:03:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:03:53,988 INFO L93 Difference]: Finished difference Result 1473 states and 2495 transitions. [2018-09-14 16:03:53,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:03:53,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-09-14 16:03:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:03:54,002 INFO L225 Difference]: With dead ends: 1473 [2018-09-14 16:03:54,003 INFO L226 Difference]: Without dead ends: 954 [2018-09-14 16:03:54,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:03:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-14 16:03:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 953. [2018-09-14 16:03:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-09-14 16:03:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1483 transitions. [2018-09-14 16:03:54,056 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1483 transitions. Word has length 211 [2018-09-14 16:03:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:03:54,057 INFO L480 AbstractCegarLoop]: Abstraction has 953 states and 1483 transitions. [2018-09-14 16:03:54,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:03:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1483 transitions. [2018-09-14 16:03:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-14 16:03:54,062 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:03:54,063 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:03:54,063 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:03:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1723298015, now seen corresponding path program 1 times [2018-09-14 16:03:54,064 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:03:54,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:54,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:03:54,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:54,065 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:03:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:03:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:03:54,384 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:03:54,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 16:03:54,387 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:03:54,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 16:03:54,388 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 16:03:54,388 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:03:54,388 INFO L87 Difference]: Start difference. First operand 953 states and 1483 transitions. Second operand 3 states. [2018-09-14 16:03:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:03:57,448 INFO L93 Difference]: Finished difference Result 2750 states and 4390 transitions. [2018-09-14 16:03:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:03:57,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-09-14 16:03:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:03:57,465 INFO L225 Difference]: With dead ends: 2750 [2018-09-14 16:03:57,466 INFO L226 Difference]: Without dead ends: 1803 [2018-09-14 16:03:57,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:03:57,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-09-14 16:03:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1786. [2018-09-14 16:03:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2018-09-14 16:03:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2741 transitions. [2018-09-14 16:03:57,557 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2741 transitions. Word has length 213 [2018-09-14 16:03:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:03:57,563 INFO L480 AbstractCegarLoop]: Abstraction has 1786 states and 2741 transitions. [2018-09-14 16:03:57,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:03:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2741 transitions. [2018-09-14 16:03:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-14 16:03:57,575 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:03:57,575 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:03:57,577 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:03:57,577 INFO L82 PathProgramCache]: Analyzing trace with hash -989729704, now seen corresponding path program 1 times [2018-09-14 16:03:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:03:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:57,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:03:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:03:57,579 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:03:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:03:57,865 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-09-14 16:03:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:03:58,149 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:03:58,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 16:03:58,150 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:03:58,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:03:58,150 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:03:58,151 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:03:58,151 INFO L87 Difference]: Start difference. First operand 1786 states and 2741 transitions. Second operand 6 states. [2018-09-14 16:04:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:01,563 INFO L93 Difference]: Finished difference Result 5463 states and 9150 transitions. [2018-09-14 16:04:01,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 16:04:01,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-09-14 16:04:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:01,605 INFO L225 Difference]: With dead ends: 5463 [2018-09-14 16:04:01,606 INFO L226 Difference]: Without dead ends: 3683 [2018-09-14 16:04:01,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 16:04:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2018-09-14 16:04:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3579. [2018-09-14 16:04:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3579 states. [2018-09-14 16:04:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 5617 transitions. [2018-09-14 16:04:01,857 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 5617 transitions. Word has length 216 [2018-09-14 16:04:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:01,858 INFO L480 AbstractCegarLoop]: Abstraction has 3579 states and 5617 transitions. [2018-09-14 16:04:01,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:04:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 5617 transitions. [2018-09-14 16:04:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-14 16:04:01,875 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:01,876 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:04:01,876 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:01,876 INFO L82 PathProgramCache]: Analyzing trace with hash -381167688, now seen corresponding path program 1 times [2018-09-14 16:04:01,877 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:01,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:01,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:01,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:01,878 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:02,180 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:02,180 INFO L197 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-09-14 16:04:02,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:02,191 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:02,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:02,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:03,074 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:03,074 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:04:03,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:03,092 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:03,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:03,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:03,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:04:03,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-14 16:04:03,786 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:04:03,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 16:04:03,788 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 16:04:03,788 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 16:04:03,788 INFO L87 Difference]: Start difference. First operand 3579 states and 5617 transitions. Second operand 9 states. [2018-09-14 16:04:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:07,896 INFO L93 Difference]: Finished difference Result 11397 states and 18861 transitions. [2018-09-14 16:04:07,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:04:07,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-09-14 16:04:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:07,949 INFO L225 Difference]: With dead ends: 11397 [2018-09-14 16:04:07,950 INFO L226 Difference]: Without dead ends: 7824 [2018-09-14 16:04:07,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 916 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-09-14 16:04:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2018-09-14 16:04:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 7690. [2018-09-14 16:04:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7690 states. [2018-09-14 16:04:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7690 states to 7690 states and 11421 transitions. [2018-09-14 16:04:08,257 INFO L78 Accepts]: Start accepts. Automaton has 7690 states and 11421 transitions. Word has length 231 [2018-09-14 16:04:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:08,257 INFO L480 AbstractCegarLoop]: Abstraction has 7690 states and 11421 transitions. [2018-09-14 16:04:08,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 16:04:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7690 states and 11421 transitions. [2018-09-14 16:04:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-14 16:04:08,287 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:08,288 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:04:08,288 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1020476221, now seen corresponding path program 1 times [2018-09-14 16:04:08,289 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:08,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:08,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:08,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:08,290 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:08,611 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:04:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 16:04:08,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:08,967 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-14 16:04:08,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:08,982 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:09,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-14 16:04:09,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 16:04:09,851 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:09,851 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:04:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:09,875 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:10,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-14 16:04:10,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 16:04:10,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:04:10,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 14 [2018-09-14 16:04:10,845 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:04:10,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-14 16:04:10,846 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-14 16:04:10,848 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-09-14 16:04:10,849 INFO L87 Difference]: Start difference. First operand 7690 states and 11421 transitions. Second operand 8 states. [2018-09-14 16:04:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:15,157 INFO L93 Difference]: Finished difference Result 29814 states and 50977 transitions. [2018-09-14 16:04:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-14 16:04:15,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2018-09-14 16:04:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:15,308 INFO L225 Difference]: With dead ends: 29814 [2018-09-14 16:04:15,308 INFO L226 Difference]: Without dead ends: 22130 [2018-09-14 16:04:15,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 975 GetRequests, 954 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-09-14 16:04:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22130 states. [2018-09-14 16:04:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22130 to 16463. [2018-09-14 16:04:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16463 states. [2018-09-14 16:04:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16463 states to 16463 states and 23782 transitions. [2018-09-14 16:04:16,028 INFO L78 Accepts]: Start accepts. Automaton has 16463 states and 23782 transitions. Word has length 240 [2018-09-14 16:04:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:16,028 INFO L480 AbstractCegarLoop]: Abstraction has 16463 states and 23782 transitions. [2018-09-14 16:04:16,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-14 16:04:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 16463 states and 23782 transitions. [2018-09-14 16:04:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-14 16:04:16,083 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:16,084 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:04:16,084 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1146264365, now seen corresponding path program 1 times [2018-09-14 16:04:16,085 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:16,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:16,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:16,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:16,086 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:16,665 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-14 16:04:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:16,860 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:16,860 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:16,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:16,874 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:17,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 16:04:17,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 16:04:17,286 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 16:04:17,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-14 16:04:17,287 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:04:17,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 16:04:17,288 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 16:04:17,288 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-14 16:04:17,288 INFO L87 Difference]: Start difference. First operand 16463 states and 23782 transitions. Second operand 3 states. [2018-09-14 16:04:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:21,161 INFO L93 Difference]: Finished difference Result 46887 states and 68680 transitions. [2018-09-14 16:04:21,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:04:21,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-09-14 16:04:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:21,295 INFO L225 Difference]: With dead ends: 46887 [2018-09-14 16:04:21,295 INFO L226 Difference]: Without dead ends: 30430 [2018-09-14 16:04:21,354 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 496 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-14 16:04:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30430 states. [2018-09-14 16:04:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30430 to 30050. [2018-09-14 16:04:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30050 states. [2018-09-14 16:04:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30050 states to 30050 states and 42897 transitions. [2018-09-14 16:04:22,503 INFO L78 Accepts]: Start accepts. Automaton has 30050 states and 42897 transitions. Word has length 249 [2018-09-14 16:04:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:22,504 INFO L480 AbstractCegarLoop]: Abstraction has 30050 states and 42897 transitions. [2018-09-14 16:04:22,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:04:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30050 states and 42897 transitions. [2018-09-14 16:04:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-14 16:04:22,611 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:22,612 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:04:22,612 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:22,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2002933879, now seen corresponding path program 1 times [2018-09-14 16:04:22,613 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:22,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:22,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:22,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:22,614 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 34 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-14 16:04:23,207 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:23,207 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:23,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:23,231 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:23,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-09-14 16:04:23,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:24,210 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-14 16:04:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 81 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-14 16:04:24,363 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 16:04:24,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-14 16:04:24,364 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:04:24,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:04:24,365 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:04:24,365 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-09-14 16:04:24,365 INFO L87 Difference]: Start difference. First operand 30050 states and 42897 transitions. Second operand 5 states. [2018-09-14 16:04:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:26,479 INFO L93 Difference]: Finished difference Result 62086 states and 91933 transitions. [2018-09-14 16:04:26,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:04:26,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 290 [2018-09-14 16:04:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:26,642 INFO L225 Difference]: With dead ends: 62086 [2018-09-14 16:04:26,643 INFO L226 Difference]: Without dead ends: 32042 [2018-09-14 16:04:26,743 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-14 16:04:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32042 states. [2018-09-14 16:04:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32042 to 31605. [2018-09-14 16:04:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31605 states. [2018-09-14 16:04:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31605 states to 31605 states and 43508 transitions. [2018-09-14 16:04:27,950 INFO L78 Accepts]: Start accepts. Automaton has 31605 states and 43508 transitions. Word has length 290 [2018-09-14 16:04:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:27,950 INFO L480 AbstractCegarLoop]: Abstraction has 31605 states and 43508 transitions. [2018-09-14 16:04:27,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:04:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 31605 states and 43508 transitions. [2018-09-14 16:04:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-14 16:04:28,024 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:28,025 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 16:04:28,025 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1015585134, now seen corresponding path program 1 times [2018-09-14 16:04:28,025 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:28,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:28,027 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-14 16:04:28,633 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:28,633 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:28,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:28,645 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:28,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-14 16:04:29,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-14 16:04:29,463 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 16:04:29,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2018-09-14 16:04:29,464 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:04:29,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 16:04:29,465 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 16:04:29,465 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-14 16:04:29,466 INFO L87 Difference]: Start difference. First operand 31605 states and 43508 transitions. Second operand 4 states. [2018-09-14 16:04:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:31,009 INFO L93 Difference]: Finished difference Result 62220 states and 85746 transitions. [2018-09-14 16:04:31,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 16:04:31,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2018-09-14 16:04:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:31,103 INFO L225 Difference]: With dead ends: 62220 [2018-09-14 16:04:31,104 INFO L226 Difference]: Without dead ends: 30621 [2018-09-14 16:04:31,169 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 589 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-14 16:04:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30621 states. [2018-09-14 16:04:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30621 to 30254. [2018-09-14 16:04:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30254 states. [2018-09-14 16:04:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30254 states to 30254 states and 39169 transitions. [2018-09-14 16:04:31,730 INFO L78 Accepts]: Start accepts. Automaton has 30254 states and 39169 transitions. Word has length 296 [2018-09-14 16:04:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:31,731 INFO L480 AbstractCegarLoop]: Abstraction has 30254 states and 39169 transitions. [2018-09-14 16:04:31,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 16:04:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 30254 states and 39169 transitions. [2018-09-14 16:04:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-09-14 16:04:31,786 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:31,787 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:04:31,787 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash 210930398, now seen corresponding path program 1 times [2018-09-14 16:04:31,788 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:31,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:31,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:31,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:31,789 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 115 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-14 16:04:32,888 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:32,888 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:32,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:32,904 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:33,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 134 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-14 16:04:33,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 115 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-14 16:04:33,358 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:33,359 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:04:33,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:33,381 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:33,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:34,297 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-09-14 16:04:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 115 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-14 16:04:34,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 115 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-14 16:04:34,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:04:34,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 5] total 9 [2018-09-14 16:04:34,890 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:04:34,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:04:34,891 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:04:34,891 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-09-14 16:04:34,891 INFO L87 Difference]: Start difference. First operand 30254 states and 39169 transitions. Second operand 6 states. [2018-09-14 16:04:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:37,860 INFO L93 Difference]: Finished difference Result 68120 states and 92251 transitions. [2018-09-14 16:04:37,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 16:04:37,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 299 [2018-09-14 16:04:37,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:37,977 INFO L225 Difference]: With dead ends: 68120 [2018-09-14 16:04:37,978 INFO L226 Difference]: Without dead ends: 37872 [2018-09-14 16:04:38,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1192 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-09-14 16:04:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37872 states. [2018-09-14 16:04:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37872 to 37150. [2018-09-14 16:04:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37150 states. [2018-09-14 16:04:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37150 states to 37150 states and 46973 transitions. [2018-09-14 16:04:39,379 INFO L78 Accepts]: Start accepts. Automaton has 37150 states and 46973 transitions. Word has length 299 [2018-09-14 16:04:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:39,379 INFO L480 AbstractCegarLoop]: Abstraction has 37150 states and 46973 transitions. [2018-09-14 16:04:39,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:04:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 37150 states and 46973 transitions. [2018-09-14 16:04:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-14 16:04:39,437 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:39,437 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:04:39,437 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:39,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1598867416, now seen corresponding path program 1 times [2018-09-14 16:04:39,438 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:39,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:39,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:39,439 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:39,741 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-09-14 16:04:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 107 proven. 90 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 16:04:39,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:39,863 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:39,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:39,871 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:40,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-09-14 16:04:40,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 109 proven. 58 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-14 16:04:40,649 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 16:04:40,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 5] total 15 [2018-09-14 16:04:40,649 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:04:40,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:04:40,650 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:04:40,650 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-14 16:04:40,650 INFO L87 Difference]: Start difference. First operand 37150 states and 46973 transitions. Second operand 5 states. [2018-09-14 16:04:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:42,678 INFO L93 Difference]: Finished difference Result 72386 states and 94161 transitions. [2018-09-14 16:04:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 16:04:42,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2018-09-14 16:04:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:42,801 INFO L225 Difference]: With dead ends: 72386 [2018-09-14 16:04:42,801 INFO L226 Difference]: Without dead ends: 35252 [2018-09-14 16:04:42,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 612 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-09-14 16:04:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35252 states. [2018-09-14 16:04:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35252 to 34272. [2018-09-14 16:04:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34272 states. [2018-09-14 16:04:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34272 states to 34272 states and 41832 transitions. [2018-09-14 16:04:43,648 INFO L78 Accepts]: Start accepts. Automaton has 34272 states and 41832 transitions. Word has length 310 [2018-09-14 16:04:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:43,648 INFO L480 AbstractCegarLoop]: Abstraction has 34272 states and 41832 transitions. [2018-09-14 16:04:43,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:04:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 34272 states and 41832 transitions. [2018-09-14 16:04:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-09-14 16:04:43,685 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:43,685 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 16:04:43,685 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash 507561166, now seen corresponding path program 1 times [2018-09-14 16:04:43,686 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:43,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:43,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:43,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:43,687 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 120 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:44,072 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:44,072 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:44,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:44,081 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:44,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 120 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:44,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 120 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:45,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:45,188 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:04:45,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:45,204 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:45,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 108 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:45,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 120 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:46,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:04:46,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 7, 5] total 9 [2018-09-14 16:04:46,104 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:04:46,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:04:46,105 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:04:46,105 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-09-14 16:04:46,106 INFO L87 Difference]: Start difference. First operand 34272 states and 41832 transitions. Second operand 6 states. [2018-09-14 16:04:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:47,247 INFO L93 Difference]: Finished difference Result 64238 states and 78429 transitions. [2018-09-14 16:04:47,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-14 16:04:47,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 311 [2018-09-14 16:04:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:47,314 INFO L225 Difference]: With dead ends: 64238 [2018-09-14 16:04:47,314 INFO L226 Difference]: Without dead ends: 30017 [2018-09-14 16:04:47,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1250 GetRequests, 1238 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-09-14 16:04:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30017 states. [2018-09-14 16:04:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30017 to 29723. [2018-09-14 16:04:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29723 states. [2018-09-14 16:04:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29723 states to 29723 states and 35962 transitions. [2018-09-14 16:04:47,994 INFO L78 Accepts]: Start accepts. Automaton has 29723 states and 35962 transitions. Word has length 311 [2018-09-14 16:04:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:47,995 INFO L480 AbstractCegarLoop]: Abstraction has 29723 states and 35962 transitions. [2018-09-14 16:04:47,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:04:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 29723 states and 35962 transitions. [2018-09-14 16:04:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-09-14 16:04:48,038 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:04:48,039 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 16:04:48,039 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:04:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 948752280, now seen corresponding path program 1 times [2018-09-14 16:04:48,040 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:04:48,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:48,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:04:48,041 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:04:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:48,499 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:48,500 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:04:48,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:48,509 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:48,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:48,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:48,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:04:48,944 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:04:48,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:04:48,960 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:04:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:04:49,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:04:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:49,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:04:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:04:50,205 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:04:50,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 6, 5] total 14 [2018-09-14 16:04:50,206 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:04:50,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:04:50,207 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:04:50,207 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-14 16:04:50,207 INFO L87 Difference]: Start difference. First operand 29723 states and 35962 transitions. Second operand 6 states. [2018-09-14 16:04:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:04:52,810 INFO L93 Difference]: Finished difference Result 58362 states and 72876 transitions. [2018-09-14 16:04:52,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 16:04:52,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 353 [2018-09-14 16:04:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:04:52,811 INFO L225 Difference]: With dead ends: 58362 [2018-09-14 16:04:52,811 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 16:04:52,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1405 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-09-14 16:04:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 16:04:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 16:04:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 16:04:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 16:04:52,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 353 [2018-09-14 16:04:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:04:52,904 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 16:04:52,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:04:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 16:04:52,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 16:04:52,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 16:04:53,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:53,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:54,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:55,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:55,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:55,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:55,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:55,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:55,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:55,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:56,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:57,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:57,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:57,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,285 WARN L178 SmtUtils]: Spent 4.74 s on a formula simplification. DAG size of input: 1115 DAG size of output: 840 [2018-09-14 16:04:58,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:58,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:59,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:59,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:59,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:04:59,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:00,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:01,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:05:02,006 WARN L178 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 1115 DAG size of output: 840 [2018-09-14 16:05:08,432 WARN L178 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 380 DAG size of output: 111 [2018-09-14 16:05:16,414 WARN L178 SmtUtils]: Spent 7.94 s on a formula simplification. DAG size of input: 786 DAG size of output: 98 [2018-09-14 16:05:24,507 WARN L178 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 786 DAG size of output: 98 [2018-09-14 16:05:24,510 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-14 16:05:24,510 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a11~0 |old(~a11~0)|) (= ~a12~0 |old(~a12~0)|) (= |old(~a22~0)| ~a22~0) (= ~a27~0 |old(~a27~0)|) (= |old(~a3~0)| ~a3~0) (= ~a5~0 |old(~a5~0)|) (= ~a6~0 |old(~a6~0)|)) [2018-09-14 16:05:24,511 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 16:05:24,511 INFO L426 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2018-09-14 16:05:24,511 INFO L426 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2018-09-14 16:05:24,511 INFO L426 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,511 INFO L426 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,511 INFO L426 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,511 INFO L426 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,511 INFO L426 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1608) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,512 INFO L426 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,513 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,517 INFO L426 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,517 INFO L426 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,517 INFO L426 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,517 INFO L426 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,517 INFO L426 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2018-09-14 16:05:24,517 INFO L426 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2018-09-14 16:05:24,517 INFO L426 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2018-09-14 16:05:24,517 INFO L426 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,518 INFO L426 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,519 INFO L426 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,520 INFO L426 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2018-09-14 16:05:24,521 INFO L426 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,522 INFO L426 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,523 INFO L426 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2018-09-14 16:05:24,524 INFO L426 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2018-09-14 16:05:24,525 INFO L426 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2018-09-14 16:05:24,526 INFO L426 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-09-14 16:05:24,526 INFO L426 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,526 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,526 INFO L426 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,526 INFO L426 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2018-09-14 16:05:24,526 INFO L426 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2018-09-14 16:05:24,526 INFO L426 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,527 INFO L422 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 54 1650) the Hoare annotation is: (let ((.cse25 (not (= 1 |old(~a26~0)|))) (.cse7 (= ~a6~0 0)) (.cse1 (<= ~a11~0 |old(~a11~0)|)) (.cse19 (= ~a27~0 1)) (.cse6 (= 1 ~a12~0)) (.cse18 (= ~a12~0 |old(~a12~0)|)) (.cse13 (= ~a6~0 |old(~a6~0)|)) (.cse22 (= 1 ~a26~0)) (.cse3 (= |old(~a22~0)| ~a22~0)) (.cse2 (= ~a27~0 |old(~a27~0)|)) (.cse4 (= |old(~a3~0)| ~a3~0)) (.cse14 (= 1 ~a11~0)) (.cse5 (= ~a5~0 |old(~a5~0)|)) (.cse15 (= 2 |old(~a3~0)|)) (.cse27 (not (= 0 |old(~a6~0)|))) (.cse20 (= 1 |old(~a12~0)|)) (.cse16 (not (= 1 |old(~a11~0)|)))) (let ((.cse24 (or .cse27 .cse20 .cse16)) (.cse11 (or .cse27 .cse15)) (.cse26 (and .cse18 .cse13 .cse22 .cse3 .cse2 .cse4 .cse14 .cse5)) (.cse32 (< 0 |old(~a3~0)|)) (.cse31 (and .cse13 .cse1 .cse3 .cse4 .cse19 .cse5 .cse6)) (.cse33 (and .cse18 .cse13 .cse3 .cse4 .cse19 .cse14 .cse5)) (.cse30 (and .cse1 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7)) (.cse12 (< |old(~a3~0)| 1)) (.cse28 (and .cse18 .cse2 .cse3 .cse4 .cse14 .cse5 .cse7)) (.cse23 (or .cse27 .cse25 .cse16)) (.cse21 (not (= 1 |old(~a27~0)|))) (.cse17 (not (= 1 |old(~a6~0)|))) (.cse0 (not .cse20)) (.cse8 (not (= 1 |old(~a5~0)|))) (.cse9 (< 0 |old(~a27~0)|)) (.cse10 (< 0 |old(~a11~0)|)) (.cse29 (or .cse27 .cse25))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 (and .cse13 .cse3 .cse2 .cse4 .cse14 .cse5 .cse6) .cse15 .cse8 .cse9 .cse16 .cse17) (or (and .cse18 .cse13 .cse1 .cse3 .cse4 .cse19 .cse5) .cse8 .cse10 .cse20 .cse21 .cse17) (or .cse22 .cse8 .cse21 .cse23) (or .cse0 .cse23 .cse22 .cse8 .cse9) (or .cse24 .cse8 (and .cse18 .cse3 .cse4 .cse19 .cse14 .cse5 .cse7) .cse21) (or .cse8 .cse25 .cse9 .cse20 .cse16 .cse26 .cse17) (or (and .cse18 .cse1 .cse3 .cse4 .cse19 .cse5 .cse7) (or .cse27 .cse20) .cse8 .cse10 .cse21) (or .cse24 .cse12 .cse8 .cse9 .cse28) (or .cse22 .cse8 .cse25 .cse10 .cse21 .cse17) (or .cse0 (and .cse3 .cse4 .cse19 .cse14 .cse5 .cse6 .cse7) .cse23 .cse8 .cse21) (or .cse8 .cse25 .cse22 .cse16 .cse21 .cse17) (or .cse12 .cse11 .cse8 .cse9 .cse10 (and .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7)) (or .cse0 .cse29 .cse8 .cse30 .cse10 .cse21) (or .cse15 .cse8 .cse25 .cse22 .cse9 .cse16 .cse17) (or .cse0 .cse12 .cse31 .cse8 .cse10 .cse21 .cse17) (or .cse22 .cse12 .cse8 .cse9 .cse10 (or .cse27 .cse15 .cse25)) (or .cse0 (and .cse13 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6) .cse8 .cse9 .cse10 .cse17) (or .cse26 .cse8 .cse25 .cse9 .cse16 .cse32 .cse17) (or .cse8 .cse16 .cse21 .cse32 .cse17 .cse33) (or .cse0 .cse8 .cse25 .cse10 .cse21 .cse17 .cse31) (or .cse8 .cse33 .cse25 .cse16 .cse21 .cse17) (or .cse0 (and .cse13 .cse3 .cse4 .cse19 .cse14 .cse5 .cse6) .cse8 .cse16 .cse21 .cse17) (or (and .cse18 .cse13 .cse1 .cse3 .cse2 .cse4 .cse5) .cse12 .cse8 .cse9 .cse10 .cse17) (or .cse8 .cse33 .cse16 .cse21 (= |old(~a6~0)| |old(~a22~0)|) .cse17) (or .cse0 .cse30 .cse27 .cse12 .cse8 .cse10 .cse21) (or .cse28 .cse23 .cse8 .cse9) (or .cse22 .cse8 .cse10 .cse29 .cse21) (or (and .cse18 .cse13 .cse22 .cse1 .cse3 .cse2 .cse4 .cse5) .cse8 .cse25 .cse9 .cse10 .cse17) (or (or .cse27 .cse15 .cse25 .cse16) .cse8 .cse9 .cse22) (or .cse0 .cse8 .cse9 .cse10 .cse29 (and .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))))) [2018-09-14 16:05:24,527 INFO L426 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,527 INFO L426 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,527 INFO L426 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2018-09-14 16:05:24,527 INFO L426 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,527 INFO L426 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2018-09-14 16:05:24,528 INFO L426 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2018-09-14 16:05:24,529 INFO L426 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2018-09-14 16:05:24,530 INFO L426 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,531 INFO L426 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,532 INFO L426 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,533 INFO L426 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,534 INFO L426 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,535 INFO L426 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2018-09-14 16:05:24,536 INFO L426 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,537 INFO L426 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,538 INFO L426 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2018-09-14 16:05:24,539 INFO L426 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,540 INFO L426 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,541 INFO L426 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2018-09-14 16:05:24,542 INFO L426 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,543 INFO L426 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2018-09-14 16:05:24,544 INFO L426 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,545 INFO L426 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-09-14 16:05:24,545 INFO L426 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2018-09-14 16:05:24,545 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 16:05:24,545 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 1 ~a3~0) (= 1 ~a5~0) (= ~a27~0 1) (<= ~a11~0 0) (not (= ~a12~0 1)) (not (= ~a3~0 2)) (= ~a6~0 0) (not (= ~a22~0 ~a6~0))) [2018-09-14 16:05:24,545 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 16:05:24,545 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 16:05:24,545 INFO L426 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-09-14 16:05:24,545 INFO L426 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2018-09-14 16:05:24,545 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1652 1669) the Hoare annotation is: (or (not (= 0 |old(~a6~0)|)) (< |old(~a3~0)| 1) (= 2 |old(~a3~0)|) (not (= 1 |old(~a5~0)|)) (< 0 |old(~a11~0)|) (= 1 |old(~a12~0)|) (not (= 1 |old(~a27~0)|)) (= |old(~a6~0)| |old(~a22~0)|) (and (= ~a12~0 |old(~a12~0)|) (<= ~a11~0 |old(~a11~0)|) (= |old(~a22~0)| ~a22~0) (= |old(~a3~0)| ~a3~0) (= ~a27~0 1) (= ~a5~0 |old(~a5~0)|) (= ~a6~0 0))) [2018-09-14 16:05:24,545 INFO L426 ceAbstractionStarter]: For program point L1658-1(lines 1658 1668) no Hoare annotation was computed. [2018-09-14 16:05:24,546 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1652 1669) no Hoare annotation was computed. [2018-09-14 16:05:24,546 INFO L422 ceAbstractionStarter]: At program point L1658-3(lines 1658 1668) the Hoare annotation is: (let ((.cse9 (= 1 ~a26~0)) (.cse6 (= 1 ~a11~0)) (.cse8 (not (= ~a12~0 1))) (.cse4 (= ~a6~0 0))) (let ((.cse13 (<= ~a3~0 0)) (.cse14 (and .cse6 .cse8 .cse4)) (.cse12 (and .cse6 .cse4 .cse9)) (.cse10 (= ~a27~0 1)) (.cse1 (<= ~a11~0 0)) (.cse2 (<= 1 ~a3~0)) (.cse7 (= 1 ~a6~0)) (.cse0 (= ~a5~0 |old(~a5~0)|)) (.cse11 (= 1 ~a12~0)) (.cse3 (not (= ~a3~0 2))) (.cse5 (<= ~a27~0 0))) (or (and .cse0 (and .cse1 (and .cse2 (and .cse3 .cse4) .cse5))) (and .cse6 .cse7 .cse0 .cse8 .cse9 .cse5) (and .cse6 .cse10 .cse7 .cse0 .cse11) (not (= 1 |old(~a27~0)|)) (and (and .cse10 .cse6 (not (= ~a22~0 ~a6~0))) .cse7 .cse0) (and (and .cse12 .cse5) .cse0) (and .cse7 .cse0 (and (and .cse13 .cse6 .cse9) .cse5)) (and .cse7 .cse0 .cse11 .cse1 .cse5) (= 1 |old(~a12~0)|) (and (and .cse2 .cse14 .cse5) .cse0) (and (and (and .cse13 .cse6) .cse10) .cse7 .cse0) (and (and (and (and .cse8 .cse4) .cse10) .cse1) .cse0) (and (and .cse10 .cse14) .cse0) (= 2 |old(~a3~0)|) (= |old(~a6~0)| |old(~a22~0)|) (< |old(~a3~0)| 1) (and .cse0 (and .cse2 .cse10 .cse1 .cse4)) (and .cse2 .cse7 .cse0 .cse1 .cse5) (< 0 |old(~a11~0)|) (and (and .cse10 .cse1 .cse9) .cse7 .cse0) (not (= 0 |old(~a6~0)|)) (not (= 1 |old(~a5~0)|)) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5) (and (and .cse1 (and (and .cse4 .cse9) .cse10)) .cse0) (and (and .cse10 .cse6 .cse9) .cse7 .cse0) (and (and .cse10 .cse12) .cse0) (and .cse10 .cse7 .cse0 .cse8 .cse1) (and .cse7 .cse0 (and (and .cse9 .cse5) .cse1)) (and .cse2 .cse10 .cse7 .cse0 .cse1) (and .cse0 (and .cse1 .cse11 .cse4 .cse9 .cse5)) (and .cse2 .cse6 .cse7 .cse0 .cse11 .cse3 .cse5)))) [2018-09-14 16:05:24,546 INFO L426 ceAbstractionStarter]: For program point L1658-4(lines 1652 1669) no Hoare annotation was computed. [2018-09-14 16:05:24,547 INFO L422 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse9 (= 1 ~a26~0)) (.cse6 (= 1 ~a11~0)) (.cse8 (not (= ~a12~0 1))) (.cse4 (= ~a6~0 0))) (let ((.cse13 (<= ~a3~0 0)) (.cse14 (and .cse6 .cse8 .cse4)) (.cse12 (and .cse6 .cse4 .cse9)) (.cse10 (= ~a27~0 1)) (.cse1 (<= ~a11~0 0)) (.cse2 (<= 1 ~a3~0)) (.cse7 (= 1 ~a6~0)) (.cse0 (= ~a5~0 |old(~a5~0)|)) (.cse11 (= 1 ~a12~0)) (.cse3 (not (= ~a3~0 2))) (.cse5 (<= ~a27~0 0))) (or (and .cse0 (and .cse1 (and .cse2 (and .cse3 .cse4) .cse5))) (and .cse6 .cse7 .cse0 .cse8 .cse9 .cse5) (and .cse6 .cse10 .cse7 .cse0 .cse11) (not (= 1 |old(~a27~0)|)) (and (and .cse10 .cse6 (not (= ~a22~0 ~a6~0))) .cse7 .cse0) (and (and .cse12 .cse5) .cse0) (and .cse7 .cse0 (and (and .cse13 .cse6 .cse9) .cse5)) (and .cse7 .cse0 .cse11 .cse1 .cse5) (= 1 |old(~a12~0)|) (and (and .cse2 .cse14 .cse5) .cse0) (and (and (and .cse13 .cse6) .cse10) .cse7 .cse0) (and (and (and (and .cse8 .cse4) .cse10) .cse1) .cse0) (and (and .cse10 .cse14) .cse0) (= 2 |old(~a3~0)|) (= |old(~a6~0)| |old(~a22~0)|) (< |old(~a3~0)| 1) (and .cse0 (and .cse2 .cse10 .cse1 .cse4)) (and .cse2 .cse7 .cse0 .cse1 .cse5) (< 0 |old(~a11~0)|) (and (and .cse10 .cse1 .cse9) .cse7 .cse0) (not (= 0 |old(~a6~0)|)) (not (= 1 |old(~a5~0)|)) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5) (and (and .cse1 (and (and .cse4 .cse9) .cse10)) .cse0) (and (and .cse10 .cse6 .cse9) .cse7 .cse0) (and (and .cse10 .cse12) .cse0) (and .cse10 .cse7 .cse0 .cse8 .cse1) (and .cse7 .cse0 (and (and .cse9 .cse5) .cse1)) (and .cse2 .cse10 .cse7 .cse0 .cse1) (and .cse0 (and .cse1 .cse11 .cse4 .cse9 .cse5)) (and .cse2 .cse6 .cse7 .cse0 .cse11 .cse3 .cse5)))) [2018-09-14 16:05:24,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 04:05:24 BoogieIcfgContainer [2018-09-14 16:05:24,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 16:05:24,593 INFO L168 Benchmark]: Toolchain (without parser) took 103690.78 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -46.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-14 16:05:24,594 INFO L168 Benchmark]: CDTParser took 0.19 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-09-14 16:05:24,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1210.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. [2018-09-14 16:05:24,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-14 16:05:24,596 INFO L168 Benchmark]: Boogie Preprocessor took 348.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.3 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -941.0 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2018-09-14 16:05:24,597 INFO L168 Benchmark]: RCFGBuilder took 4897.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 255.7 MB). Peak memory consumption was 255.7 MB. Max. memory is 7.1 GB. [2018-09-14 16:05:24,598 INFO L168 Benchmark]: TraceAbstraction took 97051.10 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 530.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-14 16:05:24,603 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.19 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 1210.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 174.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 348.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.3 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -941.0 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4897.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 255.7 MB). Peak memory consumption was 255.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97051.10 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 530.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1608]: 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: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((a5 == \old(a5) && a11 <= 0 && (1 <= a3 && !(a3 == 2) && a6 == 0) && a27 <= 0) || (((((1 == a11 && 1 == a6) && a5 == \old(a5)) && !(a12 == 1)) && 1 == a26) && a27 <= 0)) || ((((1 == a11 && a27 == 1) && 1 == a6) && a5 == \old(a5)) && 1 == a12)) || !(1 == \old(a27))) || ((((a27 == 1 && 1 == a11) && !(a22 == a6)) && 1 == a6) && a5 == \old(a5))) || ((((1 == a11 && a6 == 0) && 1 == a26) && a27 <= 0) && a5 == \old(a5))) || ((1 == a6 && a5 == \old(a5)) && ((a3 <= 0 && 1 == a11) && 1 == a26) && a27 <= 0)) || ((((1 == a6 && a5 == \old(a5)) && 1 == a12) && a11 <= 0) && a27 <= 0)) || 1 == \old(a12)) || (((1 <= a3 && (1 == a11 && !(a12 == 1)) && a6 == 0) && a27 <= 0) && a5 == \old(a5))) || ((((a3 <= 0 && 1 == a11) && a27 == 1) && 1 == a6) && a5 == \old(a5))) || ((((!(a12 == 1) && a6 == 0) && a27 == 1) && a11 <= 0) && a5 == \old(a5))) || ((a27 == 1 && (1 == a11 && !(a12 == 1)) && a6 == 0) && a5 == \old(a5))) || 2 == \old(a3)) || \old(a6) == \old(a22)) || \old(a3) < 1) || (a5 == \old(a5) && ((1 <= a3 && a27 == 1) && a11 <= 0) && a6 == 0)) || ((((1 <= a3 && 1 == a6) && a5 == \old(a5)) && a11 <= 0) && a27 <= 0)) || 0 < \old(a11)) || ((((a27 == 1 && a11 <= 0) && 1 == a26) && 1 == a6) && a5 == \old(a5))) || !(0 == \old(a6))) || !(1 == \old(a5))) || (((((a5 == \old(a5) && 1 == a12) && a11 <= 0) && !(a3 == 2)) && a6 == 0) && a27 <= 0)) || ((a11 <= 0 && (a6 == 0 && 1 == a26) && a27 == 1) && a5 == \old(a5))) || ((((a27 == 1 && 1 == a11) && 1 == a26) && 1 == a6) && a5 == \old(a5))) || ((a27 == 1 && (1 == a11 && a6 == 0) && 1 == a26) && a5 == \old(a5))) || ((((a27 == 1 && 1 == a6) && a5 == \old(a5)) && !(a12 == 1)) && a11 <= 0)) || ((1 == a6 && a5 == \old(a5)) && (1 == a26 && a27 <= 0) && a11 <= 0)) || ((((1 <= a3 && a27 == 1) && 1 == a6) && a5 == \old(a5)) && a11 <= 0)) || (a5 == \old(a5) && (((a11 <= 0 && 1 == a12) && a6 == 0) && 1 == a26) && a27 <= 0)) || ((((((1 <= a3 && 1 == a11) && 1 == a6) && a5 == \old(a5)) && 1 == a12) && !(a3 == 2)) && a27 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. SAFE Result, 96.9s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 37.2s AutomataDifference, 0.0s DeadEndRemovalTime, 31.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 3062 SDtfs, 10971 SDslu, 2108 SDs, 0 SdLazy, 17158 SolverSat, 3234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8129 GetRequests, 7989 SyntacticMatches, 33 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37150occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 9108 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 1239 PreInvPairs, 1719 NumberOfFragments, 2289 HoareAnnotationTreeSize, 1239 FomulaSimplifications, 217926 FormulaSimplificationTreeSizeReduction, 9.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 110092 FormulaSimplificationTreeSizeReductionInter, 22.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 7430 NumberOfCodeBlocks, 7430 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 11402 ConstructedInterpolants, 0 QuantifiedInterpolants, 6540689 SizeOfPredicates, 14 NumberOfNonLiveVariables, 16144 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 41 InterpolantComputations, 9 PerfectInterpolantSequences, 3861/4438 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label24_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_16-05-24-626.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label24_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_16-05-24-626.csv Received shutdown request...