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-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label16_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:03:34,204 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:03:34,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:03:34,219 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:03:34,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:03:34,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:03:34,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:03:34,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:03:34,225 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:03:34,226 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:03:34,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:03:34,227 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:03:34,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:03:34,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:03:34,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:03:34,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:03:34,232 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:03:34,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:03:34,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:03:34,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:03:34,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:03:34,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:03:34,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:03:34,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:03:34,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:03:34,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:03:34,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:03:34,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:03:34,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:03:34,248 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:03:34,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:03:34,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:03:34,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:03:34,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:03:34,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:03:34,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:03:34,252 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-LIM.epf [2018-11-12 19:03:34,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:03:34,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:03:34,287 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:03:34,287 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:03:34,287 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:03:34,287 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:03:34,287 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:03:34,288 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:03:34,288 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:03:34,288 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:03:34,289 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:03:34,289 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:03:34,289 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:03:34,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:03:34,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:03:34,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:03:34,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:03:34,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:03:34,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:03:34,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:03:34,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:03:34,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:03:34,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:03:34,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:03:34,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:03:34,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:03:34,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:03:34,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:03:34,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:03:34,294 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:03:34,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:03:34,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:03:34,295 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:03:34,295 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:03:34,295 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:03:34,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:03:34,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:03:34,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:03:34,391 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:03:34,391 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:03:34,392 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label16_true-unreach-call_false-termination.c [2018-11-12 19:03:34,453 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b63ee56f0/d16b980ec4f04e9aba0b1f10c3ebb392/FLAG695e5aa09 [2018-11-12 19:03:34,985 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:03:34,986 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label16_true-unreach-call_false-termination.c [2018-11-12 19:03:35,022 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b63ee56f0/d16b980ec4f04e9aba0b1f10c3ebb392/FLAG695e5aa09 [2018-11-12 19:03:35,044 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b63ee56f0/d16b980ec4f04e9aba0b1f10c3ebb392 [2018-11-12 19:03:35,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:03:35,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:03:35,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:03:35,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:03:35,066 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:03:35,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:35,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15dd37f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35, skipping insertion in model container [2018-11-12 19:03:35,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:35,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:03:35,158 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:03:35,691 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:03:35,699 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:03:35,870 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:03:35,897 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:03:35,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35 WrapperNode [2018-11-12 19:03:35,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:03:35,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:03:35,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:03:35,899 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:03:35,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:03:36,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:03:36,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:03:36,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:03:36,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (1/1) ... [2018-11-12 19:03:36,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:03:36,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:03:36,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:03:36,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:03:36,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (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-12 19:03:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 19:03:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:03:36,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:03:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 19:03:36,221 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 19:03:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:03:36,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:03:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:03:36,221 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:03:39,844 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:03:39,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:03:39 BoogieIcfgContainer [2018-11-12 19:03:39,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:03:39,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:03:39,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:03:39,849 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:03:39,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:03:35" (1/3) ... [2018-11-12 19:03:39,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44af7015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:03:39, skipping insertion in model container [2018-11-12 19:03:39,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:35" (2/3) ... [2018-11-12 19:03:39,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44af7015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:03:39, skipping insertion in model container [2018-11-12 19:03:39,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:03:39" (3/3) ... [2018-11-12 19:03:39,854 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label16_true-unreach-call_false-termination.c [2018-11-12 19:03:39,864 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:03:39,873 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:03:39,890 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:03:39,930 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:03:39,930 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:03:39,930 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:03:39,930 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:03:39,930 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:03:39,931 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:03:39,931 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:03:39,931 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:03:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-12 19:03:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 19:03:39,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:39,971 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] [2018-11-12 19:03:39,973 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:39,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash -31911287, now seen corresponding path program 1 times [2018-11-12 19:03:39,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:40,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:40,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:40,477 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-12 19:03:40,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:03:40,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:03:40,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:40,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:03:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:03:40,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:03:40,508 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-12 19:03:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:42,139 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-12 19:03:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:03:42,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-12 19:03:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:42,163 INFO L225 Difference]: With dead ends: 691 [2018-11-12 19:03:42,164 INFO L226 Difference]: Without dead ends: 434 [2018-11-12 19:03:42,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:03:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-12 19:03:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-12 19:03:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-12 19:03:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 767 transitions. [2018-11-12 19:03:42,289 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 767 transitions. Word has length 53 [2018-11-12 19:03:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:42,290 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 767 transitions. [2018-11-12 19:03:42,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:03:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 767 transitions. [2018-11-12 19:03:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-12 19:03:42,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:42,299 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 19:03:42,299 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:42,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:42,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1819744651, now seen corresponding path program 1 times [2018-11-12 19:03:42,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:42,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:42,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:42,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:03:42,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 19:03:42,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:42,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 19:03:42,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 19:03:42,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 19:03:42,635 INFO L87 Difference]: Start difference. First operand 434 states and 767 transitions. Second operand 5 states. [2018-11-12 19:03:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:46,361 INFO L93 Difference]: Finished difference Result 1416 states and 2580 transitions. [2018-11-12 19:03:46,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:03:46,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-11-12 19:03:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:46,380 INFO L225 Difference]: With dead ends: 1416 [2018-11-12 19:03:46,380 INFO L226 Difference]: Without dead ends: 988 [2018-11-12 19:03:46,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:03:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-12 19:03:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2018-11-12 19:03:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-11-12 19:03:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1540 transitions. [2018-11-12 19:03:46,502 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1540 transitions. Word has length 130 [2018-11-12 19:03:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:46,503 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1540 transitions. [2018-11-12 19:03:46,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 19:03:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1540 transitions. [2018-11-12 19:03:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 19:03:46,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:46,519 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:03:46,519 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:46,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1183375861, now seen corresponding path program 1 times [2018-11-12 19:03:46,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:46,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:46,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:46,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:46,842 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:03:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:47,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:03:47,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:03:47,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:47,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:03:47,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:03:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:03:47,168 INFO L87 Difference]: Start difference. First operand 973 states and 1540 transitions. Second operand 6 states. [2018-11-12 19:03:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:50,693 INFO L93 Difference]: Finished difference Result 2347 states and 3916 transitions. [2018-11-12 19:03:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:03:50,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2018-11-12 19:03:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:50,710 INFO L225 Difference]: With dead ends: 2347 [2018-11-12 19:03:50,710 INFO L226 Difference]: Without dead ends: 1380 [2018-11-12 19:03:50,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:03:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-11-12 19:03:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1352. [2018-11-12 19:03:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-12 19:03:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2126 transitions. [2018-11-12 19:03:50,766 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2126 transitions. Word has length 194 [2018-11-12 19:03:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:50,767 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2126 transitions. [2018-11-12 19:03:50,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:03:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2126 transitions. [2018-11-12 19:03:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-12 19:03:50,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:50,772 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:03:50,772 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:50,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:50,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1047862584, now seen corresponding path program 1 times [2018-11-12 19:03:50,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:50,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:50,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:50,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:50,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:51,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:51,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:51,002 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-12 19:03:51,004 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:03:51,073 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:51,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:51,556 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:03:51,580 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:51,581 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Performed 641 root evaluator evaluations with a maximum evaluation depth of 6. Performed 641 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 19:03:51,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:51,625 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:52,148 INFO L227 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 78.07% of their original sizes. [2018-11-12 19:03:52,149 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:03:52,519 INFO L415 sIntCurrentIteration]: We unified 203 AI predicates to 203 [2018-11-12 19:03:52,519 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:03:52,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:03:52,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-12 19:03:52,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:52,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 19:03:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 19:03:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:03:52,522 INFO L87 Difference]: Start difference. First operand 1352 states and 2126 transitions. Second operand 7 states. [2018-11-12 19:04:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:07,955 INFO L93 Difference]: Finished difference Result 2883 states and 4473 transitions. [2018-11-12 19:04:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:04:07,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2018-11-12 19:04:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:07,964 INFO L225 Difference]: With dead ends: 2883 [2018-11-12 19:04:07,964 INFO L226 Difference]: Without dead ends: 1537 [2018-11-12 19:04:07,970 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:04:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-12 19:04:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2018-11-12 19:04:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-12 19:04:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2316 transitions. [2018-11-12 19:04:08,013 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2316 transitions. Word has length 204 [2018-11-12 19:04:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:08,013 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 2316 transitions. [2018-11-12 19:04:08,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 19:04:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2316 transitions. [2018-11-12 19:04:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-12 19:04:08,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:08,020 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:04:08,020 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:08,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:08,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1412912886, now seen corresponding path program 1 times [2018-11-12 19:04:08,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:08,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:08,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:08,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:08,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 290 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-12 19:04:08,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:08,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:08,305 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-11-12 19:04:08,306 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:08,311 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:08,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:08,366 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:08,516 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:08,517 INFO L272 AbstractInterpreter]: Visited 94 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Performed 1712 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1712 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:04:08,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:08,558 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:09,115 INFO L227 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 78.98% of their original sizes. [2018-11-12 19:04:09,115 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:10,652 INFO L415 sIntCurrentIteration]: We unified 288 AI predicates to 288 [2018-11-12 19:04:10,652 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:10,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [7] total 25 [2018-11-12 19:04:10,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:10,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 19:04:10,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 19:04:10,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-12 19:04:10,654 INFO L87 Difference]: Start difference. First operand 1535 states and 2316 transitions. Second operand 20 states. [2018-11-12 19:04:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:32,620 INFO L93 Difference]: Finished difference Result 4338 states and 6173 transitions. [2018-11-12 19:04:32,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:04:32,621 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 289 [2018-11-12 19:04:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:32,634 INFO L225 Difference]: With dead ends: 4338 [2018-11-12 19:04:32,634 INFO L226 Difference]: Without dead ends: 2992 [2018-11-12 19:04:32,641 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 298 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-12 19:04:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-11-12 19:04:32,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2617. [2018-11-12 19:04:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2617 states. [2018-11-12 19:04:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 3464 transitions. [2018-11-12 19:04:32,717 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 3464 transitions. Word has length 289 [2018-11-12 19:04:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:32,718 INFO L480 AbstractCegarLoop]: Abstraction has 2617 states and 3464 transitions. [2018-11-12 19:04:32,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 19:04:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 3464 transitions. [2018-11-12 19:04:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-12 19:04:32,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:32,726 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 19:04:32,727 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:32,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash 506782370, now seen corresponding path program 1 times [2018-11-12 19:04:32,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:32,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:33,738 WARN L179 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 19:04:33,934 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 19:04:34,140 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 19:04:34,420 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 19:04:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 292 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:04:34,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:34,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:34,856 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 316 with the following transitions: [2018-11-12 19:04:34,856 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:34,861 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:34,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:34,916 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:35,045 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:35,046 INFO L272 AbstractInterpreter]: Visited 120 different actions 236 times. Merged at 5 different actions 7 times. Never widened. Performed 3036 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3036 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:04:35,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:35,051 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:35,392 INFO L227 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 78.36% of their original sizes. [2018-11-12 19:04:35,392 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:35,963 INFO L415 sIntCurrentIteration]: We unified 314 AI predicates to 314 [2018-11-12 19:04:35,963 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:35,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:35,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2018-11-12 19:04:35,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:35,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 19:04:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 19:04:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:04:35,965 INFO L87 Difference]: Start difference. First operand 2617 states and 3464 transitions. Second operand 18 states. [2018-11-12 19:04:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:45,763 INFO L93 Difference]: Finished difference Result 4336 states and 6044 transitions. [2018-11-12 19:04:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:04:45,763 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 315 [2018-11-12 19:04:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:45,775 INFO L225 Difference]: With dead ends: 4336 [2018-11-12 19:04:45,775 INFO L226 Difference]: Without dead ends: 2990 [2018-11-12 19:04:45,783 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 334 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 19:04:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2018-11-12 19:04:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2985. [2018-11-12 19:04:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2018-11-12 19:04:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 3861 transitions. [2018-11-12 19:04:45,858 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 3861 transitions. Word has length 315 [2018-11-12 19:04:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:45,858 INFO L480 AbstractCegarLoop]: Abstraction has 2985 states and 3861 transitions. [2018-11-12 19:04:45,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 19:04:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 3861 transitions. [2018-11-12 19:04:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-11-12 19:04:45,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:45,868 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 19:04:45,868 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:45,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash 69249902, now seen corresponding path program 1 times [2018-11-12 19:04:45,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:45,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:45,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 215 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:04:46,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:46,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:46,695 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 326 with the following transitions: [2018-11-12 19:04:46,696 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:46,700 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:46,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:46,771 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:47,419 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:47,419 INFO L272 AbstractInterpreter]: Visited 130 different actions 256 times. Merged at 5 different actions 7 times. Never widened. Performed 4340 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4340 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:04:47,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:47,431 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:47,963 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 78.29% of their original sizes. [2018-11-12 19:04:47,964 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:48,613 INFO L415 sIntCurrentIteration]: We unified 324 AI predicates to 324 [2018-11-12 19:04:48,614 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:48,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:48,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [13] total 32 [2018-11-12 19:04:48,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:48,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 19:04:48,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 19:04:48,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-11-12 19:04:48,615 INFO L87 Difference]: Start difference. First operand 2985 states and 3861 transitions. Second operand 21 states. [2018-11-12 19:05:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:06,534 INFO L93 Difference]: Finished difference Result 5491 states and 7385 transitions. [2018-11-12 19:05:06,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 19:05:06,534 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 325 [2018-11-12 19:05:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:06,545 INFO L225 Difference]: With dead ends: 5491 [2018-11-12 19:05:06,545 INFO L226 Difference]: Without dead ends: 4145 [2018-11-12 19:05:06,551 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 332 GetRequests, 299 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2018-11-12 19:05:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2018-11-12 19:05:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3519. [2018-11-12 19:05:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3519 states. [2018-11-12 19:05:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 3519 states and 4428 transitions. [2018-11-12 19:05:06,636 INFO L78 Accepts]: Start accepts. Automaton has 3519 states and 4428 transitions. Word has length 325 [2018-11-12 19:05:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:06,637 INFO L480 AbstractCegarLoop]: Abstraction has 3519 states and 4428 transitions. [2018-11-12 19:05:06,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 19:05:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3519 states and 4428 transitions. [2018-11-12 19:05:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-12 19:05:06,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:06,648 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:06,648 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:06,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1508985931, now seen corresponding path program 1 times [2018-11-12 19:05:06,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:06,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:06,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:06,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:06,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:07,162 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:05:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 215 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:05:07,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:07,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:07,650 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 351 with the following transitions: [2018-11-12 19:05:07,651 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:07,653 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:07,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:07,689 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:08,532 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:08,532 INFO L272 AbstractInterpreter]: Visited 155 different actions 303 times. Merged at 4 different actions 4 times. Never widened. Performed 4199 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4199 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:05:08,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:08,558 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:09,142 INFO L227 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 79.07% of their original sizes. [2018-11-12 19:05:09,142 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:09,687 INFO L415 sIntCurrentIteration]: We unified 349 AI predicates to 349 [2018-11-12 19:05:09,687 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:09,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:09,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2018-11-12 19:05:09,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:09,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 19:05:09,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 19:05:09,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:05:09,689 INFO L87 Difference]: Start difference. First operand 3519 states and 4428 transitions. Second operand 19 states. [2018-11-12 19:05:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:29,192 INFO L93 Difference]: Finished difference Result 6022 states and 7951 transitions. [2018-11-12 19:05:29,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 19:05:29,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 350 [2018-11-12 19:05:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:29,208 INFO L225 Difference]: With dead ends: 6022 [2018-11-12 19:05:29,208 INFO L226 Difference]: Without dead ends: 4676 [2018-11-12 19:05:29,213 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 357 GetRequests, 328 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-11-12 19:05:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2018-11-12 19:05:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4049. [2018-11-12 19:05:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2018-11-12 19:05:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 4993 transitions. [2018-11-12 19:05:29,723 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 4993 transitions. Word has length 350 [2018-11-12 19:05:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:29,724 INFO L480 AbstractCegarLoop]: Abstraction has 4049 states and 4993 transitions. [2018-11-12 19:05:29,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 19:05:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 4993 transitions. [2018-11-12 19:05:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-12 19:05:29,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:29,736 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:29,736 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:29,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:29,737 INFO L82 PathProgramCache]: Analyzing trace with hash 124735386, now seen corresponding path program 1 times [2018-11-12 19:05:29,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:29,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:29,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:29,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-12 19:05:30,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:30,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:30,040 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 352 with the following transitions: [2018-11-12 19:05:30,040 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:30,043 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:30,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:30,173 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:30,271 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:30,272 INFO L272 AbstractInterpreter]: Visited 120 different actions 356 times. Merged at 8 different actions 18 times. Never widened. Performed 3421 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3421 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 19:05:30,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:30,282 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:30,562 INFO L227 lantSequenceWeakener]: Weakened 348 states. On average, predicates are now at 80.39% of their original sizes. [2018-11-12 19:05:30,562 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:30,642 INFO L415 sIntCurrentIteration]: We unified 350 AI predicates to 350 [2018-11-12 19:05:30,642 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:30,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:30,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-12 19:05:30,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:30,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 19:05:30,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 19:05:30,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 19:05:30,644 INFO L87 Difference]: Start difference. First operand 4049 states and 4993 transitions. Second operand 10 states. [2018-11-12 19:05:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:39,017 INFO L93 Difference]: Finished difference Result 5987 states and 8046 transitions. [2018-11-12 19:05:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 19:05:39,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 351 [2018-11-12 19:05:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:39,033 INFO L225 Difference]: With dead ends: 5987 [2018-11-12 19:05:39,033 INFO L226 Difference]: Without dead ends: 4641 [2018-11-12 19:05:39,039 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 358 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:05:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2018-11-12 19:05:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 4418. [2018-11-12 19:05:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2018-11-12 19:05:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 5455 transitions. [2018-11-12 19:05:39,131 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 5455 transitions. Word has length 351 [2018-11-12 19:05:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:39,132 INFO L480 AbstractCegarLoop]: Abstraction has 4418 states and 5455 transitions. [2018-11-12 19:05:39,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 19:05:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 5455 transitions. [2018-11-12 19:05:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-11-12 19:05:39,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:39,150 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:39,150 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:39,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash 354228427, now seen corresponding path program 1 times [2018-11-12 19:05:39,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:39,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:39,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:39,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:39,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 225 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:05:40,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:40,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:40,004 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 421 with the following transitions: [2018-11-12 19:05:40,004 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:40,007 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:40,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:40,075 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:40,316 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:40,317 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Performed 4482 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4482 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:05:40,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:40,322 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:40,980 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 77.98% of their original sizes. [2018-11-12 19:05:40,980 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:41,961 INFO L415 sIntCurrentIteration]: We unified 419 AI predicates to 419 [2018-11-12 19:05:41,962 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:41,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:41,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 30 [2018-11-12 19:05:41,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:41,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 19:05:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 19:05:41,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-12 19:05:41,964 INFO L87 Difference]: Start difference. First operand 4418 states and 5455 transitions. Second operand 20 states. [2018-11-12 19:06:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:04,966 INFO L93 Difference]: Finished difference Result 7291 states and 9447 transitions. [2018-11-12 19:06:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 19:06:04,967 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 420 [2018-11-12 19:06:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:04,985 INFO L225 Difference]: With dead ends: 7291 [2018-11-12 19:06:04,985 INFO L226 Difference]: Without dead ends: 5576 [2018-11-12 19:06:04,991 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 428 GetRequests, 399 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-11-12 19:06:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states. [2018-11-12 19:06:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 4948. [2018-11-12 19:06:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2018-11-12 19:06:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 6018 transitions. [2018-11-12 19:06:05,085 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 6018 transitions. Word has length 420 [2018-11-12 19:06:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:05,086 INFO L480 AbstractCegarLoop]: Abstraction has 4948 states and 6018 transitions. [2018-11-12 19:06:05,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 19:06:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 6018 transitions. [2018-11-12 19:06:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-11-12 19:06:05,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:05,106 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:06:05,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:05,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash -991073885, now seen corresponding path program 1 times [2018-11-12 19:06:05,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:05,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:05,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 213 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:06:06,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:06,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:06,078 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 433 with the following transitions: [2018-11-12 19:06:06,078 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:06,081 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:06,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:06,138 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:06,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:06,371 INFO L272 AbstractInterpreter]: Visited 180 different actions 353 times. Merged at 4 different actions 4 times. Never widened. Performed 5042 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5042 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:06:06,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:06,381 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:06,955 INFO L227 lantSequenceWeakener]: Weakened 93 states. On average, predicates are now at 78.01% of their original sizes. [2018-11-12 19:06:06,955 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:07,967 INFO L415 sIntCurrentIteration]: We unified 431 AI predicates to 431 [2018-11-12 19:06:07,967 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:07,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:07,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [14] total 31 [2018-11-12 19:06:07,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:07,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 19:06:07,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 19:06:07,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:06:07,969 INFO L87 Difference]: Start difference. First operand 4948 states and 6018 transitions. Second operand 19 states. [2018-11-12 19:06:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:37,638 INFO L93 Difference]: Finished difference Result 7820 states and 10009 transitions. [2018-11-12 19:06:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 19:06:37,638 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 432 [2018-11-12 19:06:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:37,651 INFO L225 Difference]: With dead ends: 7820 [2018-11-12 19:06:37,651 INFO L226 Difference]: Without dead ends: 6105 [2018-11-12 19:06:37,657 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 440 GetRequests, 408 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-11-12 19:06:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2018-11-12 19:06:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5476. [2018-11-12 19:06:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5476 states. [2018-11-12 19:06:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 6579 transitions. [2018-11-12 19:06:37,754 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 6579 transitions. Word has length 432 [2018-11-12 19:06:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:37,755 INFO L480 AbstractCegarLoop]: Abstraction has 5476 states and 6579 transitions. [2018-11-12 19:06:37,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 19:06:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 6579 transitions. [2018-11-12 19:06:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-11-12 19:06:37,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:37,770 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:06:37,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:37,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash -110806031, now seen corresponding path program 1 times [2018-11-12 19:06:37,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:37,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:37,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:37,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:37,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-12 19:06:38,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:06:38,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:06:38,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:38,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:06:38,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:06:38,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:06:38,173 INFO L87 Difference]: Start difference. First operand 5476 states and 6579 transitions. Second operand 4 states. [2018-11-12 19:06:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:39,684 INFO L93 Difference]: Finished difference Result 10280 states and 12908 transitions. [2018-11-12 19:06:39,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:06:39,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 454 [2018-11-12 19:06:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:39,711 INFO L225 Difference]: With dead ends: 10280 [2018-11-12 19:06:39,711 INFO L226 Difference]: Without dead ends: 7137 [2018-11-12 19:06:39,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:06:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7137 states. [2018-11-12 19:06:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7137 to 7137. [2018-11-12 19:06:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7137 states. [2018-11-12 19:06:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 8437 transitions. [2018-11-12 19:06:39,854 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 8437 transitions. Word has length 454 [2018-11-12 19:06:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:39,855 INFO L480 AbstractCegarLoop]: Abstraction has 7137 states and 8437 transitions. [2018-11-12 19:06:39,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:06:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 8437 transitions. [2018-11-12 19:06:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-11-12 19:06:39,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:39,876 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 19:06:39,876 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:39,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 566153054, now seen corresponding path program 1 times [2018-11-12 19:06:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:39,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:39,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 277 proven. 166 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-11-12 19:06:40,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:40,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:40,197 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 463 with the following transitions: [2018-11-12 19:06:40,198 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [614], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:40,199 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:40,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:40,268 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:40,477 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:40,477 INFO L272 AbstractInterpreter]: Visited 123 different actions 366 times. Merged at 7 different actions 19 times. Never widened. Performed 4425 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 19:06:40,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:40,490 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:41,641 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 77.5% of their original sizes. [2018-11-12 19:06:41,641 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:42,048 INFO L415 sIntCurrentIteration]: We unified 461 AI predicates to 461 [2018-11-12 19:06:42,048 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:42,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:42,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-12 19:06:42,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:42,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 19:06:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 19:06:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:06:42,050 INFO L87 Difference]: Start difference. First operand 7137 states and 8437 transitions. Second operand 17 states. [2018-11-12 19:06:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:58,449 INFO L93 Difference]: Finished difference Result 13942 states and 16725 transitions. [2018-11-12 19:06:58,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 19:06:58,449 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 462 [2018-11-12 19:06:58,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:58,463 INFO L225 Difference]: With dead ends: 13942 [2018-11-12 19:06:58,463 INFO L226 Difference]: Without dead ends: 7554 [2018-11-12 19:06:58,477 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 473 GetRequests, 443 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-11-12 19:06:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7554 states. [2018-11-12 19:06:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7554 to 7348. [2018-11-12 19:06:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7348 states. [2018-11-12 19:06:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7348 states to 7348 states and 8718 transitions. [2018-11-12 19:06:58,603 INFO L78 Accepts]: Start accepts. Automaton has 7348 states and 8718 transitions. Word has length 462 [2018-11-12 19:06:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:58,603 INFO L480 AbstractCegarLoop]: Abstraction has 7348 states and 8718 transitions. [2018-11-12 19:06:58,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 19:06:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7348 states and 8718 transitions. [2018-11-12 19:06:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2018-11-12 19:06:58,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:58,627 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 19:06:58,627 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:58,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1110659752, now seen corresponding path program 1 times [2018-11-12 19:06:58,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:58,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:58,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:58,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:58,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:59,313 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 19:07:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 418 proven. 299 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-12 19:07:00,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:00,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:07:00,351 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 555 with the following transitions: [2018-11-12 19:07:00,351 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [614], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:07:00,354 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:07:00,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:07:00,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:07:01,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:07:01,819 INFO L272 AbstractInterpreter]: Visited 191 different actions 1141 times. Merged at 9 different actions 54 times. Widened at 1 different actions 1 times. Performed 14258 root evaluator evaluations with a maximum evaluation depth of 6. Performed 14258 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 19:07:01,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:01,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:07:01,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:01,827 INFO L192 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-12 19:07:01,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:01,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:07:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:02,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:07:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-11-12 19:07:02,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:07:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-11-12 19:07:02,738 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:07:02,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [13] total 14 [2018-11-12 19:07:02,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:07:02,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:07:02,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:07:02,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-12 19:07:02,739 INFO L87 Difference]: Start difference. First operand 7348 states and 8718 transitions. Second operand 3 states. [2018-11-12 19:07:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:04,195 INFO L93 Difference]: Finished difference Result 11517 states and 14730 transitions. [2018-11-12 19:07:04,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:07:04,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 554 [2018-11-12 19:07:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:04,197 INFO L225 Difference]: With dead ends: 11517 [2018-11-12 19:07:04,197 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 19:07:04,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1120 GetRequests, 1107 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-12 19:07:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 19:07:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 19:07:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 19:07:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 19:07:04,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 554 [2018-11-12 19:07:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:04,221 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 19:07:04,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:07:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 19:07:04,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 19:07:04,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 19:07:04,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:07:05,221 WARN L179 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2018-11-12 19:07:05,834 WARN L179 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-11-12 19:07:08,216 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 234 DAG size of output: 111 [2018-11-12 19:07:08,327 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2018-11-12 19:07:08,432 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2018-11-12 19:07:08,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= |old(~a15~0)| ~a15~0)) [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 19:07:08,436 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-12 19:07:08,437 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-12 19:07:08,438 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 19:07:08,439 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-12 19:07:08,440 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,441 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-12 19:07:08,442 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-12 19:07:08,443 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 19:07:08,444 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-12 19:07:08,445 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse23 (< |old(~a21~0)| 7)) (.cse22 (< 10 |old(~a21~0)|)) (.cse11 (not (= 1 |old(~a24~0)|))) (.cse13 (not (= 0 (+ |old(~a12~0)| 49)))) (.cse18 (= ~a24~0 1)) (.cse19 (<= ~a21~0 10)) (.cse0 (= ~a12~0 |old(~a12~0)|)) (.cse1 (= |old(~a15~0)| ~a15~0))) (let ((.cse2 (= 8 |old(~a21~0)|)) (.cse15 (and .cse0 .cse1)) (.cse4 (not (= 4 ~inputD~0))) (.cse7 (not (= ~inputE~0 5))) (.cse8 (not (= ~inputA~0 1))) (.cse9 (not (= 3 ~inputC~0))) (.cse10 (not (= 2 ~inputB~0))) (.cse14 (not (= ~inputF~0 6))) (.cse17 (and (<= 7 ~a21~0) .cse18 .cse19)) (.cse6 (< 6 |calculate_output_#in~input|)) (.cse12 (not (= 8 |old(~a15~0)|))) (.cse5 (< |calculate_output_#in~input| 1)) (.cse3 (= ~a21~0 7)) (.cse20 (<= ~a21~0 7)) (.cse21 (< 7 |old(~a21~0)|)) (.cse16 (let ((.cse24 (< |old(~a15~0)| 5))) (and (or .cse24 .cse22 .cse11 .cse13 .cse23 (< 8 |old(~a15~0)|)) (or (< |old(~a21~0)| 6) .cse24 .cse22 .cse11 .cse13 (< 7 |old(~a15~0)|)))))) (and (or (and .cse0 (not (= ~a21~0 8)) .cse1) .cse2) (or (or (= ~a21~0 10) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (not (= 10 |old(~a21~0)|)) .cse11 .cse12 .cse13) .cse14) (or .cse15 (= 5 |old(~a15~0)|)) (or .cse16 .cse2 (or .cse17 (and (<= ~a15~0 7) (<= 6 ~a21~0) .cse18 .cse19))) (or (< 80 |old(~a12~0)|) .cse15) (or .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse14) (or .cse17 (or .cse6 .cse22 .cse11 .cse12 .cse23 .cse5)) (or (or .cse3 (and .cse20 (<= 6 ~a15~0))) (and (or .cse21 (< |old(~a15~0)| 6)) (not (= 7 |old(~a21~0)|))) .cse16)))) [2018-11-12 19:07:08,445 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-12 19:07:08,445 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-12 19:07:08,445 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,445 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-12 19:07:08,446 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-12 19:07:08,447 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 19:07:08,448 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 19:07:08,449 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 19:07:08,450 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 19:07:08,451 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 19:07:08,452 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-12 19:07:08,453 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-12 19:07:08,454 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-12 19:07:08,455 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-12 19:07:08,456 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,457 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 19:07:08,458 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 19:07:08,459 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-12 19:07:08,459 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:07:08,459 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= ~a21~0 7) (= ~inputD~0 4)) [2018-11-12 19:07:08,459 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 19:07:08,459 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:07:08,459 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (and (= (+ ~a12~0 49) 0) (= ~a21~0 7) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6))) [2018-11-12 19:07:08,459 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-12 19:07:08,460 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (or (not (= ~a21~0 8)) (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 5 ~a15~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)) (<= ~a12~0 80)) [2018-11-12 19:07:08,460 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-12 19:07:08,460 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-12 19:07:08,460 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-12 19:07:08,460 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (or (not (= ~a21~0 8)) (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 5 ~a15~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)) (<= ~a12~0 80)) [2018-11-12 19:07:08,460 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-12 19:07:08,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:07:08 BoogieIcfgContainer [2018-11-12 19:07:08,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 19:07:08,474 INFO L168 Benchmark]: Toolchain (without parser) took 213416.49 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -738.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 19:07:08,475 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:07:08,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.64 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:08,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -856.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:08,477 INFO L168 Benchmark]: Boogie Preprocessor took 119.87 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:07:08,478 INFO L168 Benchmark]: RCFGBuilder took 3688.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:08,478 INFO L168 Benchmark]: TraceAbstraction took 208627.42 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -65.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 19:07:08,483 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 837.64 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 137.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -856.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.87 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3688.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208627.42 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -65.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 142]: 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: 880]: Loop Invariant Derived loop invariant: (((((((((((!(a21 == 8) || !(\old(a15) == 8)) || !(4 == inputD)) || !(inputE == 5)) || !(inputA == 1)) || !(3 == inputC)) || !(2 == inputB)) || !(5 == a15)) || !(1 == \old(a24))) || !(\old(a21) == 7)) || !(0 == \old(a12) + 49)) || !(inputF == 6)) || a12 <= 80 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 208.5s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 174.2s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2747 SDtfs, 29736 SDslu, 2404 SDs, 0 SdLazy, 30684 SolverSat, 3129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.7s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 4373 GetRequests, 4102 SyntacticMatches, 25 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7348occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.3s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9971650543264183 AbsIntWeakeningRatio, 0.09174896463841987 AbsIntAvgWeakeningVarsNumRemoved, 11.6928958266964 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 3364 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 126 PreInvPairs, 182 NumberOfFragments, 600 HoareAnnotationTreeSize, 126 FomulaSimplifications, 13733 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4275 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 5087 NumberOfCodeBlocks, 5087 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5625 ConstructedInterpolants, 0 QuantifiedInterpolants, 12505831 SizeOfPredicates, 2 NumberOfNonLiveVariables, 813 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 5396/6658 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...