java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:48:52,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:48:52,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:48:52,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:48:52,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:48:52,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:48:52,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:48:52,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:48:52,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:48:52,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:48:52,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:48:52,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:48:52,885 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:48:52,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:48:52,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:48:52,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:48:52,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:48:52,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:48:52,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:48:52,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:48:52,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:48:52,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:48:52,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:48:52,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:48:52,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:48:52,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:48:52,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:48:52,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:48:52,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:48:52,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:48:52,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:48:52,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:48:52,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:48:52,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:48:52,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:48:52,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:48:52,909 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:48:52,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:48:52,926 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:48:52,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:48:52,927 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:48:52,927 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:48:52,927 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:48:52,928 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:48:52,928 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:48:52,928 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:48:52,928 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:48:52,928 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:48:52,929 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:48:52,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:48:52,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:48:52,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:48:52,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:48:52,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:48:52,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:48:52,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:48:52,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:48:52,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:48:52,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:48:52,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:48:52,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:48:52,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:48:52,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:48:52,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:48:52,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:48:52,935 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:48:52,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:48:52,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:48:52,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:48:52,936 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:48:52,937 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:48:52,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:48:53,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:48:53,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:48:53,021 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:48:53,021 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:48:53,022 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 12:48:53,090 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a56e639d/3982306b5e4f4080b7e3123e22f21766/FLAG8c4885dbb [2018-11-07 12:48:53,734 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:48:53,734 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 12:48:53,757 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a56e639d/3982306b5e4f4080b7e3123e22f21766/FLAG8c4885dbb [2018-11-07 12:48:53,776 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a56e639d/3982306b5e4f4080b7e3123e22f21766 [2018-11-07 12:48:53,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:48:53,791 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:48:53,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:48:53,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:48:53,800 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:48:53,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:48:53" (1/1) ... [2018-11-07 12:48:53,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f02a909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:53, skipping insertion in model container [2018-11-07 12:48:53,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:48:53" (1/1) ... [2018-11-07 12:48:53,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:48:53,894 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:48:54,309 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:48:54,314 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:48:54,423 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:48:54,447 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:48:54,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54 WrapperNode [2018-11-07 12:48:54,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:48:54,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:48:54,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:48:54,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:48:54,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:48:54,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:48:54,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:48:54,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:48:54,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... [2018-11-07 12:48:54,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:48:54,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:48:54,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:48:54,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:48:54,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:48:54,785 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:48:54,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:48:54,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:48:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:48:54,786 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:48:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:48:54,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:48:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:48:54,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:48:57,887 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:48:57,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:48:57 BoogieIcfgContainer [2018-11-07 12:48:57,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:48:57,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:48:57,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:48:57,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:48:57,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:48:53" (1/3) ... [2018-11-07 12:48:57,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d295980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:48:57, skipping insertion in model container [2018-11-07 12:48:57,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:48:54" (2/3) ... [2018-11-07 12:48:57,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d295980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:48:57, skipping insertion in model container [2018-11-07 12:48:57,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:48:57" (3/3) ... [2018-11-07 12:48:57,900 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 12:48:57,913 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:48:57,925 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:48:57,945 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:48:57,994 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:48:57,994 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:48:57,995 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:48:57,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:48:57,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:48:57,995 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:48:57,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:48:57,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:48:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:48:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 12:48:58,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:48:58,043 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:48:58,046 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:48:58,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:48:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1144269880, now seen corresponding path program 1 times [2018-11-07 12:48:58,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:48:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:58,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:48:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:48:58,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:48:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:48:58,760 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:48:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:48:58,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:48:58,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:48:58,906 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:48:58,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:48:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:48:58,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:48:58,932 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:49:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:00,429 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:49:00,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:49:00,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-11-07 12:49:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:00,452 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:49:00,452 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:49:00,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:49:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:49:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:49:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:49:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-07 12:49:00,552 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 112 [2018-11-07 12:49:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:00,553 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-07 12:49:00,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:49:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-07 12:49:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 12:49:00,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:00,566 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 12:49:00,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:00,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -255516033, now seen corresponding path program 1 times [2018-11-07 12:49:00,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:00,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:00,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:00,840 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:49:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:00,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:49:00,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:49:00,928 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:00,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:49:00,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:49:00,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:49:00,931 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-11-07 12:49:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:02,922 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-11-07 12:49:02,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:49:02,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-11-07 12:49:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:02,933 INFO L225 Difference]: With dead ends: 1079 [2018-11-07 12:49:02,933 INFO L226 Difference]: Without dead ends: 745 [2018-11-07 12:49:02,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 12:49:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-07 12:49:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-11-07 12:49:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-07 12:49:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-11-07 12:49:03,000 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 122 [2018-11-07 12:49:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:03,000 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-11-07 12:49:03,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:49:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-11-07 12:49:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 12:49:03,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:03,008 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 12:49:03,009 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:03,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash -289707029, now seen corresponding path program 1 times [2018-11-07 12:49:03,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:03,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:03,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:03,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:03,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:03,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:49:03,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:49:03,228 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:03,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:49:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:49:03,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:49:03,232 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 3 states. [2018-11-07 12:49:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:05,033 INFO L93 Difference]: Finished difference Result 1919 states and 3096 transitions. [2018-11-07 12:49:05,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:49:05,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-11-07 12:49:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:05,045 INFO L225 Difference]: With dead ends: 1919 [2018-11-07 12:49:05,045 INFO L226 Difference]: Without dead ends: 1192 [2018-11-07 12:49:05,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:49:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-11-07 12:49:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2018-11-07 12:49:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-11-07 12:49:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1735 transitions. [2018-11-07 12:49:05,132 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1735 transitions. Word has length 132 [2018-11-07 12:49:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:05,133 INFO L480 AbstractCegarLoop]: Abstraction has 1192 states and 1735 transitions. [2018-11-07 12:49:05,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:49:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1735 transitions. [2018-11-07 12:49:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 12:49:05,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:05,145 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 12:49:05,145 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:05,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1523382030, now seen corresponding path program 1 times [2018-11-07 12:49:05,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:05,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:05,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:05,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:05,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:05,377 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-11-07 12:49:05,379 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:05,429 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:05,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:09,361 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:09,363 INFO L272 AbstractInterpreter]: Visited 116 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:49:09,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:09,414 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:10,660 INFO L227 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 80.4% of their original sizes. [2018-11-07 12:49:10,660 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:11,201 INFO L415 sIntCurrentIteration]: We unified 133 AI predicates to 133 [2018-11-07 12:49:11,202 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:11,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:11,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:49:11,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:11,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:49:11,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:49:11,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:49:11,205 INFO L87 Difference]: Start difference. First operand 1192 states and 1735 transitions. Second operand 11 states. [2018-11-07 12:49:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:24,947 INFO L93 Difference]: Finished difference Result 3249 states and 4708 transitions. [2018-11-07 12:49:24,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:49:24,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 134 [2018-11-07 12:49:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:24,961 INFO L225 Difference]: With dead ends: 3249 [2018-11-07 12:49:24,962 INFO L226 Difference]: Without dead ends: 2063 [2018-11-07 12:49:24,967 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:49:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2018-11-07 12:49:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2036. [2018-11-07 12:49:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2018-11-07 12:49:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2679 transitions. [2018-11-07 12:49:25,037 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2679 transitions. Word has length 134 [2018-11-07 12:49:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:25,037 INFO L480 AbstractCegarLoop]: Abstraction has 2036 states and 2679 transitions. [2018-11-07 12:49:25,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:49:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2679 transitions. [2018-11-07 12:49:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 12:49:25,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:25,045 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2018-11-07 12:49:25,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:25,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:25,046 INFO L82 PathProgramCache]: Analyzing trace with hash -521176307, now seen corresponding path program 1 times [2018-11-07 12:49:25,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:25,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:25,050 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:49:25,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:25,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:25,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-11-07 12:49:25,279 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:25,284 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:25,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:26,567 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:26,567 INFO L272 AbstractInterpreter]: Visited 117 different actions 184 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:49:26,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:26,582 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:27,804 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 81.52% of their original sizes. [2018-11-07 12:49:27,804 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:28,376 INFO L415 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2018-11-07 12:49:28,376 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:28,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:28,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:49:28,377 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:28,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:49:28,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:49:28,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:49:28,379 INFO L87 Difference]: Start difference. First operand 2036 states and 2679 transitions. Second operand 18 states. [2018-11-07 12:49:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:46,061 INFO L93 Difference]: Finished difference Result 4351 states and 5797 transitions. [2018-11-07 12:49:46,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:49:46,062 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2018-11-07 12:49:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:46,075 INFO L225 Difference]: With dead ends: 4351 [2018-11-07 12:49:46,075 INFO L226 Difference]: Without dead ends: 2457 [2018-11-07 12:49:46,081 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-11-07 12:49:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2018-11-07 12:49:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2447. [2018-11-07 12:49:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2018-11-07 12:49:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3132 transitions. [2018-11-07 12:49:46,149 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3132 transitions. Word has length 147 [2018-11-07 12:49:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:46,149 INFO L480 AbstractCegarLoop]: Abstraction has 2447 states and 3132 transitions. [2018-11-07 12:49:46,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:49:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3132 transitions. [2018-11-07 12:49:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 12:49:46,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:46,157 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:46,157 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:46,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:46,158 INFO L82 PathProgramCache]: Analyzing trace with hash 644918266, now seen corresponding path program 1 times [2018-11-07 12:49:46,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:46,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:46,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:46,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:46,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:49:46,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:46,274 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:46,274 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-11-07 12:49:46,275 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:46,279 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:46,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:49,217 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:49,218 INFO L272 AbstractInterpreter]: Visited 118 different actions 308 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:49:49,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:49,220 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:49,889 INFO L227 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 80.41% of their original sizes. [2018-11-07 12:49:49,889 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:49,971 INFO L415 sIntCurrentIteration]: We unified 158 AI predicates to 158 [2018-11-07 12:49:49,971 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:49,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:49,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-07 12:49:49,972 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:49,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:49:49,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:49:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:49:49,973 INFO L87 Difference]: Start difference. First operand 2447 states and 3132 transitions. Second operand 10 states. [2018-11-07 12:49:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:56,703 INFO L93 Difference]: Finished difference Result 4690 states and 6143 transitions. [2018-11-07 12:49:56,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:49:56,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2018-11-07 12:49:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:56,718 INFO L225 Difference]: With dead ends: 4690 [2018-11-07 12:49:56,718 INFO L226 Difference]: Without dead ends: 2796 [2018-11-07 12:49:56,726 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:49:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2018-11-07 12:49:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2504. [2018-11-07 12:49:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-11-07 12:49:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3228 transitions. [2018-11-07 12:49:56,798 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3228 transitions. Word has length 159 [2018-11-07 12:49:56,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:56,799 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3228 transitions. [2018-11-07 12:49:56,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:49:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3228 transitions. [2018-11-07 12:49:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 12:49:56,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:56,807 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2018-11-07 12:49:56,807 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:56,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1387665827, now seen corresponding path program 1 times [2018-11-07 12:49:56,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:56,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:56,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 12:49:57,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:57,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:57,011 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-11-07 12:49:57,011 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:57,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:57,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:01,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:50:01,297 INFO L272 AbstractInterpreter]: Visited 120 different actions 556 times. Merged at 10 different actions 47 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-07 12:50:01,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:01,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:50:01,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:01,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:50:01,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:01,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:50:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:01,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:50:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 12:50:01,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:50:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 12:50:02,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:50:02,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 12:50:02,089 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:50:02,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 12:50:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 12:50:02,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:50:02,090 INFO L87 Difference]: Start difference. First operand 2504 states and 3228 transitions. Second operand 8 states. [2018-11-07 12:50:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:07,268 INFO L93 Difference]: Finished difference Result 8893 states and 12572 transitions. [2018-11-07 12:50:07,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:50:07,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2018-11-07 12:50:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:07,297 INFO L225 Difference]: With dead ends: 8893 [2018-11-07 12:50:07,298 INFO L226 Difference]: Without dead ends: 4831 [2018-11-07 12:50:07,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:50:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2018-11-07 12:50:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4670. [2018-11-07 12:50:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2018-11-07 12:50:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 5619 transitions. [2018-11-07 12:50:07,463 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 5619 transitions. Word has length 179 [2018-11-07 12:50:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:07,464 INFO L480 AbstractCegarLoop]: Abstraction has 4670 states and 5619 transitions. [2018-11-07 12:50:07,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 12:50:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 5619 transitions. [2018-11-07 12:50:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-07 12:50:07,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:07,476 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:50:07,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:07,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1042057633, now seen corresponding path program 1 times [2018-11-07 12:50:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:07,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:07,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 12:50:07,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:07,703 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:07,703 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-11-07 12:50:07,703 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:07,708 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:07,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:10,493 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:50:10,493 INFO L272 AbstractInterpreter]: Visited 117 different actions 186 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:50:10,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:10,499 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:50:12,164 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 80.79% of their original sizes. [2018-11-07 12:50:12,164 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:50:13,102 INFO L415 sIntCurrentIteration]: We unified 179 AI predicates to 179 [2018-11-07 12:50:13,103 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:50:13,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:50:13,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-07 12:50:13,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:13,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 12:50:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 12:50:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-11-07 12:50:13,106 INFO L87 Difference]: Start difference. First operand 4670 states and 5619 transitions. Second operand 23 states. [2018-11-07 12:50:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:37,985 INFO L93 Difference]: Finished difference Result 9618 states and 11578 transitions. [2018-11-07 12:50:37,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 12:50:37,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2018-11-07 12:50:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:38,009 INFO L225 Difference]: With dead ends: 9618 [2018-11-07 12:50:38,010 INFO L226 Difference]: Without dead ends: 5228 [2018-11-07 12:50:38,026 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 152 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:50:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2018-11-07 12:50:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 4808. [2018-11-07 12:50:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4808 states. [2018-11-07 12:50:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 5766 transitions. [2018-11-07 12:50:38,151 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 5766 transitions. Word has length 180 [2018-11-07 12:50:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:38,151 INFO L480 AbstractCegarLoop]: Abstraction has 4808 states and 5766 transitions. [2018-11-07 12:50:38,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 12:50:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 5766 transitions. [2018-11-07 12:50:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 12:50:38,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:38,163 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:50:38,163 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:38,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:38,163 INFO L82 PathProgramCache]: Analyzing trace with hash 660025092, now seen corresponding path program 1 times [2018-11-07 12:50:38,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:38,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:38,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:38,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:38,165 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-07 12:50:38,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:38,343 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:38,343 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-07 12:50:38,343 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:38,346 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:38,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:43,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:50:43,101 INFO L272 AbstractInterpreter]: Visited 119 different actions 550 times. Merged at 9 different actions 46 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:50:43,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:43,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:50:43,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:43,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:50:43,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:43,122 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:50:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:43,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:50:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 12:50:43,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:50:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 82 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 12:50:43,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:50:43,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 12:50:43,451 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:50:43,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:50:43,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:50:43,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:50:43,453 INFO L87 Difference]: Start difference. First operand 4808 states and 5766 transitions. Second operand 11 states. [2018-11-07 12:50:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:45,719 INFO L93 Difference]: Finished difference Result 10567 states and 12810 transitions. [2018-11-07 12:50:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 12:50:45,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-11-07 12:50:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:45,750 INFO L225 Difference]: With dead ends: 10567 [2018-11-07 12:50:45,750 INFO L226 Difference]: Without dead ends: 6039 [2018-11-07 12:50:45,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:50:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2018-11-07 12:50:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 5886. [2018-11-07 12:50:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5886 states. [2018-11-07 12:50:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5886 states to 5886 states and 6972 transitions. [2018-11-07 12:50:45,938 INFO L78 Accepts]: Start accepts. Automaton has 5886 states and 6972 transitions. Word has length 189 [2018-11-07 12:50:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:45,939 INFO L480 AbstractCegarLoop]: Abstraction has 5886 states and 6972 transitions. [2018-11-07 12:50:45,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:50:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5886 states and 6972 transitions. [2018-11-07 12:50:45,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 12:50:45,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:45,953 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:50:45,953 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:45,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1418630858, now seen corresponding path program 2 times [2018-11-07 12:50:45,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:45,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:45,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:45,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:45,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-07 12:50:46,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:46,817 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:46,817 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 12:50:46,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 12:50:46,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:46,818 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:50:46,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 12:50:46,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 12:50:46,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 12:50:46,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 12:50:46,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:50:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 12:50:47,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:50:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 12:50:47,159 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:50:47,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 12:50:47,160 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:47,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:50:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:50:47,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:50:47,161 INFO L87 Difference]: Start difference. First operand 5886 states and 6972 transitions. Second operand 3 states. [2018-11-07 12:50:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:48,061 INFO L93 Difference]: Finished difference Result 9405 states and 11158 transitions. [2018-11-07 12:50:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:50:48,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-11-07 12:50:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:48,062 INFO L225 Difference]: With dead ends: 9405 [2018-11-07 12:50:48,062 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:50:48,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 377 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:50:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:50:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:50:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:50:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:50:48,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2018-11-07 12:50:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:48,083 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:50:48,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:50:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:50:48,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:50:48,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:50:48,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,687 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 201 [2018-11-07 12:50:48,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:50:48,997 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 191 [2018-11-07 12:50:49,703 WARN L179 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-07 12:50:50,089 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 86 [2018-11-07 12:50:55,006 WARN L179 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 321 DAG size of output: 129 [2018-11-07 12:50:55,863 WARN L179 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 99 [2018-11-07 12:50:56,572 WARN L179 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 99 [2018-11-07 12:50:56,575 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:50:56,575 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0)) [2018-11-07 12:50:56,575 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:50:56,575 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:50:56,575 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:50:56,576 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,577 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:50:56,578 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:50:56,579 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,580 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:50:56,581 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,582 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,583 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:50:56,584 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:50:56,585 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,586 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:50:56,587 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:50:56,587 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:50:56,587 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:50:56,587 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:50:56,587 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:50:56,587 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:50:56,587 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:50:56,587 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:50:56,588 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:50:56,588 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse22 (= 1 ~a7~0)) (.cse21 (not (= ~a16~0 6))) (.cse28 (<= ~a16~0 5)) (.cse29 (= ~a17~0 1)) (.cse26 (= ~a21~0 1)) (.cse27 (<= 4 ~a16~0)) (.cse31 (= ~a7~0 |old(~a7~0)|)) (.cse23 (= |old(~a8~0)| ~a8~0)) (.cse25 (= |old(~a20~0)| ~a20~0))) (let ((.cse18 (and .cse31 .cse23 .cse25)) (.cse15 (< |old(~a7~0)| 0)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse8 (< 15 |old(~a8~0)|)) (.cse2 (= 13 |old(~a8~0)|)) (.cse9 (and .cse28 .cse29 .cse26 .cse27)) (.cse10 (< |old(~a20~0)| 0)) (.cse4 (not (= 1 |old(~a17~0)|))) (.cse11 (< 5 |old(~a16~0)|)) (.cse12 (< |old(~a16~0)| 4)) (.cse13 (< |old(~a8~0)| 13)) (.cse7 (< |calculate_output_#in~input| 1)) (.cse24 (< |old(~a8~0)| 15)) (.cse30 (and .cse22 .cse23 .cse25 .cse21)) (.cse6 (not (= 1 |old(~a7~0)|))) (.cse1 (not (= 1 |old(~a21~0)|))) (.cse3 (not (= 8 ~a12~0))) (.cse17 (not (= 15 |old(~a8~0)|))) (.cse14 (< 0 |old(~a7~0)|)) (.cse16 (< 0 |old(~a20~0)|)) (.cse32 (= 1 ~a20~0)) (.cse20 (= 6 |old(~a16~0)|)) (.cse19 (< 13 |old(~a8~0)|)) (.cse5 (not (= 1 |old(~a20~0)|)))) (and (or .cse0 (or .cse1 (not (= 4 |old(~a16~0)|)) (not .cse2)) .cse3 .cse4 .cse5 (= ~a16~0 4) .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7) (or (or .cse0 .cse1 .cse3 .cse10 .cse4 .cse17 (not (= 5 |old(~a16~0)|)) .cse15 .cse7) .cse14 (= ~a16~0 5) .cse16) (or .cse2 .cse14 .cse18 .cse16) (or .cse18 .cse5 .cse14) (or .cse0 .cse1 .cse19 .cse9 .cse3 .cse4 .cse5 .cse11 .cse12 (< 1 |old(~a7~0)|) .cse13 .cse15 .cse7) (or .cse20 .cse5 .cse21 .cse14) (or .cse20 (and .cse22 .cse23 .cse21) .cse6 .cse24) (or .cse20 .cse14 .cse25 .cse16) (or .cse0 .cse1 .cse8 .cse3 (and .cse26 .cse27 .cse28 .cse29) .cse4 .cse5 .cse11 .cse12 .cse13 .cse14 .cse15 .cse7) (or .cse20 .cse5 .cse6 .cse30) (or .cse20 (= |old(~a7~0)| 1) .cse19 (and .cse31 .cse23 .cse21)) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse9 (< 1 |old(~a20~0)|) .cse10 .cse4 .cse11 .cse12 .cse6 .cse13 .cse7) (or .cse5 (and .cse22 .cse23 .cse32) .cse6 .cse24) (or .cse30 .cse20 .cse6 .cse16) (or .cse19 .cse5 (and .cse22 .cse23 .cse25) .cse6) (or (and (<= 0 ~a17~0) (<= 5 ~a16~0) .cse26 (<= ~a17~0 1) (<= ~a16~0 6)) (or (not (= 0 |old(~a7~0)|)) .cse1 .cse3 (< 1 |old(~a17~0)|) (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse5 .cse17 (< |old(~a17~0)| 0))) (or .cse20 .cse14 .cse16 .cse21) (or .cse32 .cse20 .cse19 .cse5)))) [2018-11-07 12:50:56,588 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:50:56,588 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:50:56,589 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:50:56,590 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:50:56,590 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:50:56,590 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:50:56,590 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:50:56,590 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:50:56,590 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:50:56,590 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:50:56,590 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:50:56,591 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:50:56,591 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 491) no Hoare annotation was computed. [2018-11-07 12:50:56,591 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,591 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,591 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,591 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,591 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,591 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:50:56,592 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,593 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:50:56,594 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:50:56,595 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:50:56,595 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:50:56,595 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:50:56,595 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:50:56,595 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:50:56,595 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:50:56,595 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:50:56,596 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:50:56,596 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:50:56,596 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (<= ~a8~0 |old(~a8~0)|)) (.cse4 (<= 15 ~a8~0)) (.cse7 (<= ~a8~0 13)) (.cse0 (<= ~a20~0 0)) (.cse1 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse6 (= 1 ~a20~0)) (.cse5 (not (= ~a16~0 6)))) (or (and (not (= ~a8~0 13)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse2 .cse3 .cse4 .cse6) (and .cse7 (= ~a7~0 |old(~a7~0)|) .cse5) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 .cse3 .cse6) (and .cse6 .cse1) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse3 .cse5 .cse0) (and .cse5 .cse0 .cse1) (not (= 0 |old(~a7~0)|)) (and .cse3 .cse6 .cse5) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-07 12:50:56,596 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:50:56,596 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:50:56,597 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:50:56,597 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a8~0 |old(~a8~0)|)) (.cse4 (<= 15 ~a8~0)) (.cse7 (<= ~a8~0 13)) (.cse0 (<= ~a20~0 0)) (.cse1 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse6 (= 1 ~a20~0)) (.cse5 (not (= ~a16~0 6)))) (or (and (not (= ~a8~0 13)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse2 .cse3 .cse4 .cse6) (and .cse7 (= ~a7~0 |old(~a7~0)|) .cse5) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 .cse3 .cse6) (and .cse6 .cse1) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse3 .cse5 .cse0) (and .cse5 .cse0 .cse1) (not (= 0 |old(~a7~0)|)) (and .cse3 .cse6 .cse5) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-07 12:50:56,597 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:50:56,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:50:56 BoogieIcfgContainer [2018-11-07 12:50:56,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:50:56,621 INFO L168 Benchmark]: Toolchain (without parser) took 122831.34 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -745.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-07 12:50:56,624 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:50:56,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:50:56,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:50:56,627 INFO L168 Benchmark]: Boogie Preprocessor took 122.31 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:50:56,627 INFO L168 Benchmark]: RCFGBuilder took 3185.41 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 133.1 MB). Peak memory consumption was 133.1 MB. Max. memory is 7.1 GB. [2018-11-07 12:50:56,628 INFO L168 Benchmark]: TraceAbstraction took 118729.03 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -103.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-07 12:50:56,633 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.18 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 655.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 132.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.31 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3185.41 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 133.1 MB). Peak memory consumption was 133.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118729.03 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -103.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 491]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(a8 == 13) && a20 <= 0) && a7 <= 0) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && !(a16 == 6))) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && 1 == a20)) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((a8 <= 13 && 1 == a7) && 1 == a20)) || (1 == a20 && a7 <= 0)) || !(z == 26)) || !(\old(a16) == 5)) || ((1 == a7 && !(a16 == 6)) && a20 <= 0)) || ((!(a16 == 6) && a20 <= 0) && a7 <= 0)) || !(0 == \old(a7))) || ((1 == a7 && 1 == a20) && !(a16 == 6))) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 118.6s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 76.9s AutomataDifference, 0.0s DeadEndRemovalTime, 8.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1315 SDtfs, 9709 SDslu, 1634 SDs, 0 SdLazy, 12555 SolverSat, 2114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.7s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1861 GetRequests, 1692 SyntacticMatches, 13 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5886occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 20.1s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9964271340555051 AbsIntWeakeningRatio, 0.2662337662337662 AbsIntAvgWeakeningVarsNumRemoved, 25.02922077922078 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 1075 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 194 PreInvPairs, 306 NumberOfFragments, 1166 HoareAnnotationTreeSize, 194 FomulaSimplifications, 13686 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8477 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2100 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2641 ConstructedInterpolants, 0 QuantifiedInterpolants, 846854 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1566 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 1373/1535 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...