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_label26_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:36:08,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:36:08,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:36:08,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:36:08,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:36:08,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:36:08,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:36:08,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:36:08,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:36:08,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:36:08,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:36:08,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:36:08,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:36:08,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:36:08,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:36:08,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:36:08,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:36:08,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:36:08,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:36:08,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:36:08,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:36:08,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:36:08,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:36:08,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:36:08,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:36:08,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:36:08,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:36:08,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:36:08,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:36:08,159 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:36:08,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:36:08,162 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:36:08,162 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:36:08,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:36:08,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:36:08,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:36:08,167 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-07 20:36:08,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:36:08,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:36:08,200 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:36:08,200 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:36:08,200 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:36:08,200 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:36:08,200 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:36:08,201 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:36:08,201 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:36:08,201 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:36:08,201 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:36:08,201 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:36:08,201 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:36:08,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:36:08,202 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:36:08,202 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:36:08,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:36:08,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:36:08,203 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:36:08,203 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:36:08,203 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:36:08,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:36:08,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:36:08,204 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:36:08,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:36:08,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:36:08,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:36:08,205 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:36:08,205 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:36:08,205 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:36:08,205 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:36:08,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:36:08,206 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:36:08,206 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:36:08,206 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:36:08,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:36:08,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:36:08,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:36:08,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:36:08,277 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:36:08,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label26_true-unreach-call_false-termination.c [2018-11-07 20:36:08,351 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9d2177/1ea434b9f2d741f98c45b43547abb955/FLAG083460ff3 [2018-11-07 20:36:08,942 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:36:08,943 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label26_true-unreach-call_false-termination.c [2018-11-07 20:36:08,970 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9d2177/1ea434b9f2d741f98c45b43547abb955/FLAG083460ff3 [2018-11-07 20:36:08,991 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9d2177/1ea434b9f2d741f98c45b43547abb955 [2018-11-07 20:36:09,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:36:09,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:36:09,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:36:09,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:36:09,013 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:36:09,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:08" (1/1) ... [2018-11-07 20:36:09,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0bb127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09, skipping insertion in model container [2018-11-07 20:36:09,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:08" (1/1) ... [2018-11-07 20:36:09,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:36:09,119 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:36:09,643 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:36:09,648 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:36:09,779 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:36:09,798 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:36:09,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09 WrapperNode [2018-11-07 20:36:09,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:36:09,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:36:09,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:36:09,800 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:36:09,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:09,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:09,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:36:09,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:36:09,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:36:09,940 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:36:09,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:09,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:09,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:09,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:10,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:10,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:10,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... [2018-11-07 20:36:10,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:36:10,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:36:10,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:36:10,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:36:10,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:36:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:36:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:36:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:36:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:36:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:36:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:36:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:36:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:36:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:36:13,788 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:36:13,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:13 BoogieIcfgContainer [2018-11-07 20:36:13,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:36:13,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:36:13,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:36:13,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:36:13,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:36:08" (1/3) ... [2018-11-07 20:36:13,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef82a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:13, skipping insertion in model container [2018-11-07 20:36:13,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:09" (2/3) ... [2018-11-07 20:36:13,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef82a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:13, skipping insertion in model container [2018-11-07 20:36:13,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:13" (3/3) ... [2018-11-07 20:36:13,798 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label26_true-unreach-call_false-termination.c [2018-11-07 20:36:13,808 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:36:13,818 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:36:13,835 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:36:13,875 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:36:13,875 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:36:13,875 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:36:13,875 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:36:13,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:36:13,876 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:36:13,876 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:36:13,876 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:36:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:36:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-07 20:36:13,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:13,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:13,921 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:13,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash -68379495, now seen corresponding path program 1 times [2018-11-07 20:36:13,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:13,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:13,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:36:14,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:36:14,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:36:14,491 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:14,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:36:14,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:36:14,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:36:14,517 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:36:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:16,223 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:36:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:36:16,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-07 20:36:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:16,246 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:36:16,246 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:36:16,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:36:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:36:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:36:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:36:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 767 transitions. [2018-11-07 20:36:16,352 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 767 transitions. Word has length 73 [2018-11-07 20:36:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:16,352 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 767 transitions. [2018-11-07 20:36:16,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:36:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 767 transitions. [2018-11-07 20:36:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-07 20:36:16,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:16,368 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, 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] [2018-11-07 20:36:16,368 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:16,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:16,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1913376731, now seen corresponding path program 1 times [2018-11-07 20:36:16,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:16,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:16,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:16,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:16,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:36:16,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:36:16,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:36:16,711 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:16,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:36:16,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:36:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:36:16,715 INFO L87 Difference]: Start difference. First operand 434 states and 767 transitions. Second operand 5 states. [2018-11-07 20:36:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:19,971 INFO L93 Difference]: Finished difference Result 1416 states and 2580 transitions. [2018-11-07 20:36:19,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:36:19,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-11-07 20:36:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:19,996 INFO L225 Difference]: With dead ends: 1416 [2018-11-07 20:36:19,997 INFO L226 Difference]: Without dead ends: 988 [2018-11-07 20:36:20,002 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-07 20:36:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-07 20:36:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2018-11-07 20:36:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-11-07 20:36:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1540 transitions. [2018-11-07 20:36:20,077 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1540 transitions. Word has length 150 [2018-11-07 20:36:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:20,078 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1540 transitions. [2018-11-07 20:36:20,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:36:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1540 transitions. [2018-11-07 20:36:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 20:36:20,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:20,093 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:20,093 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:20,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash -122514341, now seen corresponding path program 1 times [2018-11-07 20:36:20,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:20,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:20,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:20,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:20,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:20,534 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 20:36:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:36:20,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:36:20,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:36:20,935 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:20,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:36:20,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:36:20,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:36:20,938 INFO L87 Difference]: Start difference. First operand 973 states and 1540 transitions. Second operand 6 states. [2018-11-07 20:36:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:24,532 INFO L93 Difference]: Finished difference Result 2347 states and 3916 transitions. [2018-11-07 20:36:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:36:24,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 214 [2018-11-07 20:36:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:24,548 INFO L225 Difference]: With dead ends: 2347 [2018-11-07 20:36:24,548 INFO L226 Difference]: Without dead ends: 1380 [2018-11-07 20:36:24,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:36:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-11-07 20:36:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1352. [2018-11-07 20:36:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-07 20:36:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2126 transitions. [2018-11-07 20:36:24,607 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2126 transitions. Word has length 214 [2018-11-07 20:36:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:24,608 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2126 transitions. [2018-11-07 20:36:24,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:36:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2126 transitions. [2018-11-07 20:36:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 20:36:24,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:24,614 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:24,614 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:24,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:24,615 INFO L82 PathProgramCache]: Analyzing trace with hash -9319976, now seen corresponding path program 1 times [2018-11-07 20:36:24,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:24,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:24,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:24,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:24,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:36:25,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:25,060 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:25,061 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-07 20:36:25,063 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [490], [495], [499], [503], [507], [510], [511], [515], [519], [522], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:25,113 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:25,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:25,645 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:25,664 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:25,665 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:36:25,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:25,720 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:26,298 INFO L227 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 78.42% of their original sizes. [2018-11-07 20:36:26,298 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:26,669 INFO L415 sIntCurrentIteration]: We unified 223 AI predicates to 223 [2018-11-07 20:36:26,669 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:26,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:26,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-07 20:36:26,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:26,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:36:26,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:36:26,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:36:26,672 INFO L87 Difference]: Start difference. First operand 1352 states and 2126 transitions. Second operand 7 states. [2018-11-07 20:36:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:39,357 INFO L93 Difference]: Finished difference Result 2883 states and 4473 transitions. [2018-11-07 20:36:39,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:36:39,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2018-11-07 20:36:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:39,368 INFO L225 Difference]: With dead ends: 2883 [2018-11-07 20:36:39,368 INFO L226 Difference]: Without dead ends: 1537 [2018-11-07 20:36:39,375 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 218 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-07 20:36:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-07 20:36:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2018-11-07 20:36:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-07 20:36:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2316 transitions. [2018-11-07 20:36:39,430 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2316 transitions. Word has length 224 [2018-11-07 20:36:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:39,430 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 2316 transitions. [2018-11-07 20:36:39,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:36:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2316 transitions. [2018-11-07 20:36:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-07 20:36:39,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:39,439 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:39,440 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:39,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -720670266, now seen corresponding path program 1 times [2018-11-07 20:36:39,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:39,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:39,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 350 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 20:36:40,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:40,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:40,330 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-11-07 20:36:40,331 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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-07 20:36:40,341 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:40,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:40,458 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:40,626 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:40,627 INFO L272 AbstractInterpreter]: Visited 94 different actions 184 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:36:40,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:40,660 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:41,325 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 78% of their original sizes. [2018-11-07 20:36:41,325 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:42,619 INFO L415 sIntCurrentIteration]: We unified 308 AI predicates to 308 [2018-11-07 20:36:42,620 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:42,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:42,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [7] total 22 [2018-11-07 20:36:42,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:42,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:36:42,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:36:42,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:36:42,622 INFO L87 Difference]: Start difference. First operand 1535 states and 2316 transitions. Second operand 17 states. [2018-11-07 20:37:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:07,651 INFO L93 Difference]: Finished difference Result 4030 states and 5797 transitions. [2018-11-07 20:37:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:37:07,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 309 [2018-11-07 20:37:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:07,665 INFO L225 Difference]: With dead ends: 4030 [2018-11-07 20:37:07,665 INFO L226 Difference]: Without dead ends: 2684 [2018-11-07 20:37:07,672 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 316 GetRequests, 285 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:37:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2018-11-07 20:37:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2419. [2018-11-07 20:37:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2018-11-07 20:37:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3254 transitions. [2018-11-07 20:37:07,740 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3254 transitions. Word has length 309 [2018-11-07 20:37:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:07,740 INFO L480 AbstractCegarLoop]: Abstraction has 2419 states and 3254 transitions. [2018-11-07 20:37:07,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:37:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3254 transitions. [2018-11-07 20:37:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-07 20:37:07,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:07,750 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, 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, 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-07 20:37:07,751 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:07,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 219643762, now seen corresponding path program 1 times [2018-11-07 20:37:07,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:07,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:07,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:07,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:08,369 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 20:37:08,843 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 20:37:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 352 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:37:09,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:09,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:09,302 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2018-11-07 20:37:09,303 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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-07 20:37:09,307 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:09,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:09,347 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:09,448 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:09,448 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:37:09,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:09,459 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:09,788 INFO L227 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 78.68% of their original sizes. [2018-11-07 20:37:09,788 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:10,085 INFO L415 sIntCurrentIteration]: We unified 334 AI predicates to 334 [2018-11-07 20:37:10,085 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:10,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:10,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2018-11-07 20:37:10,086 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:10,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:37:10,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:37:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:37:10,087 INFO L87 Difference]: Start difference. First operand 2419 states and 3254 transitions. Second operand 18 states. [2018-11-07 20:37:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:17,584 INFO L93 Difference]: Finished difference Result 4138 states and 5834 transitions. [2018-11-07 20:37:17,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:37:17,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 335 [2018-11-07 20:37:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:17,599 INFO L225 Difference]: With dead ends: 4138 [2018-11-07 20:37:17,599 INFO L226 Difference]: Without dead ends: 2792 [2018-11-07 20:37:17,605 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 354 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 20:37:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2018-11-07 20:37:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2787. [2018-11-07 20:37:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2787 states. [2018-11-07 20:37:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3651 transitions. [2018-11-07 20:37:17,678 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3651 transitions. Word has length 335 [2018-11-07 20:37:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:17,679 INFO L480 AbstractCegarLoop]: Abstraction has 2787 states and 3651 transitions. [2018-11-07 20:37:17,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:37:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3651 transitions. [2018-11-07 20:37:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-07 20:37:17,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:17,689 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, 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, 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-07 20:37:17,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:17,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash -616465858, now seen corresponding path program 1 times [2018-11-07 20:37:17,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:17,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:17,691 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 275 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:37:18,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:18,418 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:18,418 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 346 with the following transitions: [2018-11-07 20:37:18,419 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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-07 20:37:18,423 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:18,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:18,459 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:18,603 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:18,603 INFO L272 AbstractInterpreter]: Visited 130 different actions 253 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:37:18,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:18,609 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:19,009 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 77.48% of their original sizes. [2018-11-07 20:37:19,009 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:19,654 INFO L415 sIntCurrentIteration]: We unified 344 AI predicates to 344 [2018-11-07 20:37:19,655 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:19,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:19,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 31 [2018-11-07 20:37:19,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:19,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 20:37:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 20:37:19,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:37:19,656 INFO L87 Difference]: Start difference. First operand 2787 states and 3651 transitions. Second operand 20 states. [2018-11-07 20:37:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:39,265 INFO L93 Difference]: Finished difference Result 5106 states and 6945 transitions. [2018-11-07 20:37:39,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 20:37:39,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 345 [2018-11-07 20:37:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:39,277 INFO L225 Difference]: With dead ends: 5106 [2018-11-07 20:37:39,277 INFO L226 Difference]: Without dead ends: 3760 [2018-11-07 20:37:39,283 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 351 GetRequests, 318 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-11-07 20:37:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2018-11-07 20:37:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3236. [2018-11-07 20:37:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3236 states. [2018-11-07 20:37:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4126 transitions. [2018-11-07 20:37:39,363 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4126 transitions. Word has length 345 [2018-11-07 20:37:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:39,364 INFO L480 AbstractCegarLoop]: Abstraction has 3236 states and 4126 transitions. [2018-11-07 20:37:39,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 20:37:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4126 transitions. [2018-11-07 20:37:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-11-07 20:37:39,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:39,377 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:37:39,377 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:39,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1084310405, now seen corresponding path program 1 times [2018-11-07 20:37:39,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:39,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:39,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:39,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:39,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:39,846 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:37:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 275 proven. 143 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:37:40,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:40,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:40,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-11-07 20:37:40,342 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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-07 20:37:40,345 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:40,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:40,373 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:40,669 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:40,669 INFO L272 AbstractInterpreter]: Visited 155 different actions 303 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:37:40,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:40,705 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:41,262 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 78% of their original sizes. [2018-11-07 20:37:41,263 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:41,928 INFO L415 sIntCurrentIteration]: We unified 369 AI predicates to 369 [2018-11-07 20:37:41,928 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:41,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:41,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 28 [2018-11-07 20:37:41,928 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:41,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:37:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:37:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:37:41,930 INFO L87 Difference]: Start difference. First operand 3236 states and 4126 transitions. Second operand 17 states. [2018-11-07 20:38:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:02,911 INFO L93 Difference]: Finished difference Result 5553 states and 7420 transitions. [2018-11-07 20:38:02,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 20:38:02,911 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 370 [2018-11-07 20:38:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:02,925 INFO L225 Difference]: With dead ends: 5553 [2018-11-07 20:38:02,926 INFO L226 Difference]: Without dead ends: 4207 [2018-11-07 20:38:02,931 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 377 GetRequests, 346 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-11-07 20:38:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2018-11-07 20:38:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 3624. [2018-11-07 20:38:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3624 states. [2018-11-07 20:38:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 4540 transitions. [2018-11-07 20:38:03,022 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 4540 transitions. Word has length 370 [2018-11-07 20:38:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:03,023 INFO L480 AbstractCegarLoop]: Abstraction has 3624 states and 4540 transitions. [2018-11-07 20:38:03,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:38:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 4540 transitions. [2018-11-07 20:38:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-11-07 20:38:03,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:03,036 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-07 20:38:03,037 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:03,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1925562474, now seen corresponding path program 1 times [2018-11-07 20:38:03,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:03,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:03,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:03,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:03,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 353 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-07 20:38:03,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:03,586 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:03,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 372 with the following transitions: [2018-11-07 20:38:03,587 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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-07 20:38:03,589 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:03,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:03,697 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:04,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:04,359 INFO L272 AbstractInterpreter]: Visited 120 different actions 359 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:38:04,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:04,360 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:04,709 INFO L227 lantSequenceWeakener]: Weakened 368 states. On average, predicates are now at 80.75% of their original sizes. [2018-11-07 20:38:04,709 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:04,802 INFO L415 sIntCurrentIteration]: We unified 370 AI predicates to 370 [2018-11-07 20:38:04,803 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:04,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:04,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-07 20:38:04,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:04,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:38:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:38:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:38:04,805 INFO L87 Difference]: Start difference. First operand 3624 states and 4540 transitions. Second operand 10 states. [2018-11-07 20:38:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:08,816 INFO L93 Difference]: Finished difference Result 5562 states and 7593 transitions. [2018-11-07 20:38:08,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:38:08,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 371 [2018-11-07 20:38:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:08,832 INFO L225 Difference]: With dead ends: 5562 [2018-11-07 20:38:08,832 INFO L226 Difference]: Without dead ends: 4216 [2018-11-07 20:38:08,839 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 378 GetRequests, 362 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-07 20:38:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2018-11-07 20:38:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 3993. [2018-11-07 20:38:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3993 states. [2018-11-07 20:38:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 5002 transitions. [2018-11-07 20:38:08,929 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 5002 transitions. Word has length 371 [2018-11-07 20:38:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:08,930 INFO L480 AbstractCegarLoop]: Abstraction has 3993 states and 5002 transitions. [2018-11-07 20:38:08,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:38:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 5002 transitions. [2018-11-07 20:38:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-11-07 20:38:08,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:08,943 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, 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, 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-07 20:38:08,943 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:08,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1610021093, now seen corresponding path program 1 times [2018-11-07 20:38:08,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:08,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:08,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:08,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 285 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:38:09,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:09,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:09,784 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2018-11-07 20:38:09,785 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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-07 20:38:09,787 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:09,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:09,849 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:10,507 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:10,508 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:38:10,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:10,509 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:11,116 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 77.49% of their original sizes. [2018-11-07 20:38:11,117 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:11,864 INFO L415 sIntCurrentIteration]: We unified 439 AI predicates to 439 [2018-11-07 20:38:11,865 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:11,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [12] total 28 [2018-11-07 20:38:11,865 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:11,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 20:38:11,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 20:38:11,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:38:11,867 INFO L87 Difference]: Start difference. First operand 3993 states and 5002 transitions. Second operand 18 states. [2018-11-07 20:38:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:44,135 INFO L93 Difference]: Finished difference Result 6760 states and 8859 transitions. [2018-11-07 20:38:44,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:38:44,136 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 440 [2018-11-07 20:38:44,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:44,152 INFO L225 Difference]: With dead ends: 6760 [2018-11-07 20:38:44,152 INFO L226 Difference]: Without dead ends: 5045 [2018-11-07 20:38:44,158 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 448 GetRequests, 415 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2018-11-07 20:38:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2018-11-07 20:38:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4543. [2018-11-07 20:38:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4543 states. [2018-11-07 20:38:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4543 states to 4543 states and 5584 transitions. [2018-11-07 20:38:44,248 INFO L78 Accepts]: Start accepts. Automaton has 4543 states and 5584 transitions. Word has length 440 [2018-11-07 20:38:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:44,249 INFO L480 AbstractCegarLoop]: Abstraction has 4543 states and 5584 transitions. [2018-11-07 20:38:44,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 20:38:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4543 states and 5584 transitions. [2018-11-07 20:38:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-11-07 20:38:44,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:44,263 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, 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, 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-07 20:38:44,263 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:44,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1145084915, now seen corresponding path program 1 times [2018-11-07 20:38:44,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:44,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:44,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:44,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:44,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:44,733 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:38:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 273 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:38:45,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:45,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:45,435 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 453 with the following transitions: [2018-11-07 20:38:45,435 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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-07 20:38:45,438 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:45,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:45,492 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:46,147 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:46,147 INFO L272 AbstractInterpreter]: Visited 180 different actions 353 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:38:46,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:46,156 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:46,749 INFO L227 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 78.38% of their original sizes. [2018-11-07 20:38:46,749 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:47,537 INFO L415 sIntCurrentIteration]: We unified 451 AI predicates to 451 [2018-11-07 20:38:47,538 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:47,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:47,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [14] total 36 [2018-11-07 20:38:47,539 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:47,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 20:38:47,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 20:38:47,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-11-07 20:38:47,540 INFO L87 Difference]: Start difference. First operand 4543 states and 5584 transitions. Second operand 24 states. [2018-11-07 20:39:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:12,591 INFO L93 Difference]: Finished difference Result 7864 states and 10136 transitions. [2018-11-07 20:39:12,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 20:39:12,591 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 452 [2018-11-07 20:39:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:12,606 INFO L225 Difference]: With dead ends: 7864 [2018-11-07 20:39:12,606 INFO L226 Difference]: Without dead ends: 6149 [2018-11-07 20:39:12,612 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 463 GetRequests, 421 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 20:39:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6149 states. [2018-11-07 20:39:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6149 to 6139. [2018-11-07 20:39:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6139 states. [2018-11-07 20:39:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6139 states to 6139 states and 7287 transitions. [2018-11-07 20:39:12,717 INFO L78 Accepts]: Start accepts. Automaton has 6139 states and 7287 transitions. Word has length 452 [2018-11-07 20:39:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:12,718 INFO L480 AbstractCegarLoop]: Abstraction has 6139 states and 7287 transitions. [2018-11-07 20:39:12,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 20:39:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 6139 states and 7287 transitions. [2018-11-07 20:39:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-11-07 20:39:12,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:12,738 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:39:12,738 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:12,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1193214145, now seen corresponding path program 1 times [2018-11-07 20:39:12,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:12,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:12,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 20:39:13,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:39:13,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:39:13,171 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:13,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:39:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:39:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:39:13,172 INFO L87 Difference]: Start difference. First operand 6139 states and 7287 transitions. Second operand 4 states. [2018-11-07 20:39:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:15,180 INFO L93 Difference]: Finished difference Result 11819 states and 14533 transitions. [2018-11-07 20:39:15,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:39:15,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 474 [2018-11-07 20:39:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:15,199 INFO L225 Difference]: With dead ends: 11819 [2018-11-07 20:39:15,199 INFO L226 Difference]: Without dead ends: 6429 [2018-11-07 20:39:15,217 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-07 20:39:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2018-11-07 20:39:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 6393. [2018-11-07 20:39:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6393 states. [2018-11-07 20:39:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6393 states to 6393 states and 7588 transitions. [2018-11-07 20:39:15,332 INFO L78 Accepts]: Start accepts. Automaton has 6393 states and 7588 transitions. Word has length 474 [2018-11-07 20:39:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:15,332 INFO L480 AbstractCegarLoop]: Abstraction has 6393 states and 7588 transitions. [2018-11-07 20:39:15,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:39:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6393 states and 7588 transitions. [2018-11-07 20:39:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-11-07 20:39:15,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:15,351 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:39:15,352 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:15,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:15,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1007478783, now seen corresponding path program 1 times [2018-11-07 20:39:15,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:15,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:15,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:15,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:15,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 357 proven. 166 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-07 20:39:19,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:19,228 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:19,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 478 with the following transitions: [2018-11-07 20:39:19,229 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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], [594], [595], [599], [603], [607], [611], [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-07 20:39:19,230 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:19,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:19,319 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:19,658 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:19,659 INFO L272 AbstractInterpreter]: Visited 123 different actions 367 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:39:19,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:19,675 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:20,262 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 77.49% of their original sizes. [2018-11-07 20:39:20,262 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:20,722 INFO L415 sIntCurrentIteration]: We unified 476 AI predicates to 476 [2018-11-07 20:39:20,722 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:20,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:20,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 20:39:20,723 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:20,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:39:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:39:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:39:20,724 INFO L87 Difference]: Start difference. First operand 6393 states and 7588 transitions. Second operand 19 states. [2018-11-07 20:39:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:42,823 INFO L93 Difference]: Finished difference Result 10503 states and 12908 transitions. [2018-11-07 20:39:42,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 20:39:42,824 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 477 [2018-11-07 20:39:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:42,840 INFO L225 Difference]: With dead ends: 10503 [2018-11-07 20:39:42,841 INFO L226 Difference]: Without dead ends: 8109 [2018-11-07 20:39:42,849 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 494 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1072, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 20:39:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2018-11-07 20:39:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 7481. [2018-11-07 20:39:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7481 states. [2018-11-07 20:39:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7481 states to 7481 states and 8772 transitions. [2018-11-07 20:39:42,983 INFO L78 Accepts]: Start accepts. Automaton has 7481 states and 8772 transitions. Word has length 477 [2018-11-07 20:39:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:42,984 INFO L480 AbstractCegarLoop]: Abstraction has 7481 states and 8772 transitions. [2018-11-07 20:39:42,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:39:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 7481 states and 8772 transitions. [2018-11-07 20:39:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-11-07 20:39:43,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:43,005 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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:39:43,006 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:43,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1738013018, now seen corresponding path program 1 times [2018-11-07 20:39:43,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:43,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:43,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:43,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:43,008 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 375 proven. 449 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:39:44,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:44,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:44,247 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 481 with the following transitions: [2018-11-07 20:39:44,247 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], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [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-07 20:39:44,249 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:44,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:44,334 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:44,519 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:44,520 INFO L272 AbstractInterpreter]: Visited 123 different actions 364 times. Merged at 7 different actions 17 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:39:44,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:44,527 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:45,137 INFO L227 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 78.07% of their original sizes. [2018-11-07 20:39:45,137 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:45,520 INFO L415 sIntCurrentIteration]: We unified 479 AI predicates to 479 [2018-11-07 20:39:45,520 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:45,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:45,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [15] total 29 [2018-11-07 20:39:45,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:45,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 20:39:45,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 20:39:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-07 20:39:45,522 INFO L87 Difference]: Start difference. First operand 7481 states and 8772 transitions. Second operand 16 states. Received shutdown request... [2018-11-07 20:39:58,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 20:39:58,058 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:39:58,063 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:39:58,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:39:58 BoogieIcfgContainer [2018-11-07 20:39:58,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:39:58,064 INFO L168 Benchmark]: Toolchain (without parser) took 229059.25 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 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:39:58,066 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:39:58,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.09 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:39:58,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2018-11-07 20:39:58,068 INFO L168 Benchmark]: Boogie Preprocessor took 144.72 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:39:58,068 INFO L168 Benchmark]: RCFGBuilder took 3704.37 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: 131.3 MB). Peak memory consumption was 131.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:39:58,069 INFO L168 Benchmark]: TraceAbstraction took 224273.29 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.6 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:39:58,073 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 792.09 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 139.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.72 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 3704.37 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: 131.3 MB). Peak memory consumption was 131.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224273.29 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.6 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 202]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 202). Cancelled while BasicCegarLoop was constructing difference of abstraction (7481states) and FLOYD_HOARE automaton (currently 20 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (3139 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 224.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 192.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2605 SDtfs, 29531 SDslu, 1923 SDs, 0 SdLazy, 31784 SolverSat, 3051 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.8s Time, PredicateUnifierStatistics: 20 DeclaredPredicates, 3923 GetRequests, 3617 SyntacticMatches, 43 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7481occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.6s AbstIntTime, 10 AbstIntIterations, 10 AbstIntStrong, 0.9973136405881966 AbsIntWeakeningRatio, 0.08594779857632481 AbsIntAvgWeakeningVarsNumRemoved, 10.666754547851305 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 2821 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 4714 NumberOfCodeBlocks, 4714 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4700 ConstructedInterpolants, 0 QuantifiedInterpolants, 10919368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 4260/5672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown