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_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:02:47,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:02:47,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:02:47,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:02:47,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:02:47,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:02:47,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:02:47,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:02:47,169 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:02:47,170 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:02:47,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:02:47,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:02:47,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:02:47,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:02:47,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:02:47,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:02:47,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:02:47,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:02:47,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:02:47,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:02:47,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:02:47,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:02:47,204 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:02:47,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:02:47,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:02:47,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:02:47,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:02:47,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:02:47,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:02:47,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:02:47,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:02:47,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:02:47,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:02:47,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:02:47,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:02:47,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:02:47,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 19:02:47,242 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:02:47,242 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:02:47,243 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:02:47,243 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:02:47,245 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:02:47,245 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:02:47,245 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:02:47,246 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:02:47,246 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:02:47,246 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:02:47,246 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:02:47,246 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:02:47,246 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:02:47,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:02:47,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:02:47,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:02:47,248 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:02:47,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:02:47,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:02:47,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:02:47,249 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:02:47,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:02:47,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:02:47,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:02:47,251 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:02:47,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:02:47,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:02:47,252 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:02:47,252 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:02:47,252 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:02:47,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:02:47,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:02:47,254 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:02:47,254 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:02:47,254 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:02:47,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:02:47,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:02:47,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:02:47,354 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:02:47,355 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:02:47,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label06_true-unreach-call_false-termination.c [2018-11-12 19:02:47,425 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44182df3/edaeb9d142f2439a818192e13dac8058/FLAG74a99d11f [2018-11-12 19:02:47,976 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:02:47,977 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label06_true-unreach-call_false-termination.c [2018-11-12 19:02:47,996 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44182df3/edaeb9d142f2439a818192e13dac8058/FLAG74a99d11f [2018-11-12 19:02:48,018 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a44182df3/edaeb9d142f2439a818192e13dac8058 [2018-11-12 19:02:48,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:02:48,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:02:48,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:02:48,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:02:48,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:02:48,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:48,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ae0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48, skipping insertion in model container [2018-11-12 19:02:48,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:48,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:02:48,134 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:02:48,665 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:02:48,669 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:02:48,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:02:48,876 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:02:48,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48 WrapperNode [2018-11-12 19:02:48,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:02:48,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:02:48,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:02:48,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:02:48,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:48,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:49,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:02:49,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:02:49,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:02:49,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:02:49,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:49,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:49,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:49,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:49,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:49,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:49,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... [2018-11-12 19:02:49,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:02:49,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:02:49,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:02:49,127 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:02:49,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:02:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 19:02:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:02:49,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:02:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 19:02:49,212 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 19:02:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:02:49,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:02:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:02:49,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:02:52,961 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:02:52,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:52 BoogieIcfgContainer [2018-11-12 19:02:52,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:02:52,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:02:52,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:02:52,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:02:52,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:02:48" (1/3) ... [2018-11-12 19:02:52,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1c65bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:02:52, skipping insertion in model container [2018-11-12 19:02:52,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:48" (2/3) ... [2018-11-12 19:02:52,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1c65bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:02:52, skipping insertion in model container [2018-11-12 19:02:52,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:52" (3/3) ... [2018-11-12 19:02:52,971 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label06_true-unreach-call_false-termination.c [2018-11-12 19:02:52,981 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:02:52,989 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:02:53,004 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:02:53,043 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:02:53,043 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:02:53,043 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:02:53,044 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:02:53,044 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:02:53,044 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:02:53,044 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:02:53,044 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:02:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-12 19:02:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-12 19:02:53,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:02:53,086 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] [2018-11-12 19:02:53,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:02:53,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1354853180, now seen corresponding path program 1 times [2018-11-12 19:02:53,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:02:53,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:53,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:02:53,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:53,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:02:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:02:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:02:53,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:02:53,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:02:53,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:02:53,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:02:53,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:02:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:02:53,706 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 4 states. [2018-11-12 19:02:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:02:56,644 INFO L93 Difference]: Finished difference Result 894 states and 1610 transitions. [2018-11-12 19:02:56,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:02:56,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-12 19:02:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:02:56,669 INFO L225 Difference]: With dead ends: 894 [2018-11-12 19:02:56,669 INFO L226 Difference]: Without dead ends: 633 [2018-11-12 19:02:56,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:02:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-11-12 19:02:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 434. [2018-11-12 19:02:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-12 19:02:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 662 transitions. [2018-11-12 19:02:56,766 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 662 transitions. Word has length 68 [2018-11-12 19:02:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:02:56,767 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 662 transitions. [2018-11-12 19:02:56,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:02:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 662 transitions. [2018-11-12 19:02:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-12 19:02:56,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:02:56,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:02:56,777 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:02:56,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:02:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash -623503772, now seen corresponding path program 1 times [2018-11-12 19:02:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:02:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:56,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:02:56,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:02:56,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:02:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:02:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:02:57,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:02:57,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:02:57,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:02:57,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:02:57,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:02:57,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:02:57,067 INFO L87 Difference]: Start difference. First operand 434 states and 662 transitions. Second operand 4 states. [2018-11-12 19:03:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:00,019 INFO L93 Difference]: Finished difference Result 1594 states and 2540 transitions. [2018-11-12 19:03:00,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:03:00,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-11-12 19:03:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:00,031 INFO L225 Difference]: With dead ends: 1594 [2018-11-12 19:03:00,031 INFO L226 Difference]: Without dead ends: 1166 [2018-11-12 19:03:00,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:03:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2018-11-12 19:03:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2018-11-12 19:03:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-11-12 19:03:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1711 transitions. [2018-11-12 19:03:00,108 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1711 transitions. Word has length 152 [2018-11-12 19:03:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:00,109 INFO L480 AbstractCegarLoop]: Abstraction has 1166 states and 1711 transitions. [2018-11-12 19:03:00,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:03:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1711 transitions. [2018-11-12 19:03:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-12 19:03:00,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:00,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:03:00,133 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:00,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash -392846149, now seen corresponding path program 1 times [2018-11-12 19:03:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:00,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:00,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:03:00,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:03:00,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:00,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:03:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:03:00,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:03:00,489 INFO L87 Difference]: Start difference. First operand 1166 states and 1711 transitions. Second operand 6 states. [2018-11-12 19:03:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:03,472 INFO L93 Difference]: Finished difference Result 3114 states and 4807 transitions. [2018-11-12 19:03:03,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:03:03,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2018-11-12 19:03:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:03,491 INFO L225 Difference]: With dead ends: 3114 [2018-11-12 19:03:03,492 INFO L226 Difference]: Without dead ends: 1954 [2018-11-12 19:03:03,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:03:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2018-11-12 19:03:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1918. [2018-11-12 19:03:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2018-11-12 19:03:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2787 transitions. [2018-11-12 19:03:03,574 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2787 transitions. Word has length 209 [2018-11-12 19:03:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:03,574 INFO L480 AbstractCegarLoop]: Abstraction has 1918 states and 2787 transitions. [2018-11-12 19:03:03,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:03:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2787 transitions. [2018-11-12 19:03:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-12 19:03:03,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:03,583 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, 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] [2018-11-12 19:03:03,583 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:03,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1160644629, now seen corresponding path program 1 times [2018-11-12 19:03:03,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:03,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:04,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:04,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:04,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2018-11-12 19:03:04,074 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [598], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:03:04,131 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:04,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:04,689 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:04,691 INFO L272 AbstractInterpreter]: Visited 101 different actions 101 times. Never merged. Never widened. Performed 836 root evaluator evaluations with a maximum evaluation depth of 6. Performed 836 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 19:03:04,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:04,735 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:05,379 INFO L227 lantSequenceWeakener]: Weakened 232 states. On average, predicates are now at 78.24% of their original sizes. [2018-11-12 19:03:05,380 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:03:05,560 INFO L415 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2018-11-12 19:03:05,560 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:03:05,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:03:05,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-12 19:03:05,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:05,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 19:03:05,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 19:03:05,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:03:05,563 INFO L87 Difference]: Start difference. First operand 1918 states and 2787 transitions. Second operand 7 states. [2018-11-12 19:03:07,385 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:03:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:20,561 INFO L93 Difference]: Finished difference Result 4015 states and 5797 transitions. [2018-11-12 19:03:20,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:03:20,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2018-11-12 19:03:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:20,577 INFO L225 Difference]: With dead ends: 4015 [2018-11-12 19:03:20,578 INFO L226 Difference]: Without dead ends: 2103 [2018-11-12 19:03:20,588 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:03:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2018-11-12 19:03:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2101. [2018-11-12 19:03:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-11-12 19:03:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2978 transitions. [2018-11-12 19:03:20,661 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2978 transitions. Word has length 241 [2018-11-12 19:03:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:20,662 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2978 transitions. [2018-11-12 19:03:20,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 19:03:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2978 transitions. [2018-11-12 19:03:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-12 19:03:20,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:20,672 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:03:20,673 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:20,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1825997348, now seen corresponding path program 1 times [2018-11-12 19:03:20,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:20,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:20,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:20,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:20,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:21,218 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-12 19:03:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 271 proven. 146 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:03:21,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:21,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:21,617 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 327 with the following transitions: [2018-11-12 19:03:21,618 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [598], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:03:21,624 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:21,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:21,897 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:21,897 INFO L272 AbstractInterpreter]: Visited 105 different actions 203 times. Merged at 4 different actions 4 times. Never widened. Performed 1953 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1953 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:03:21,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:21,936 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:22,566 INFO L227 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 78.28% of their original sizes. [2018-11-12 19:03:22,567 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:03:24,525 INFO L415 sIntCurrentIteration]: We unified 325 AI predicates to 325 [2018-11-12 19:03:24,525 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:03:24,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:03:24,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [12] total 35 [2018-11-12 19:03:24,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:24,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 19:03:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 19:03:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-11-12 19:03:24,528 INFO L87 Difference]: Start difference. First operand 2101 states and 2978 transitions. Second operand 25 states. [2018-11-12 19:03:34,976 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:03:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:56,444 INFO L93 Difference]: Finished difference Result 5838 states and 7960 transitions. [2018-11-12 19:03:56,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 19:03:56,444 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 326 [2018-11-12 19:03:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:56,462 INFO L225 Difference]: With dead ends: 5838 [2018-11-12 19:03:56,462 INFO L226 Difference]: Without dead ends: 3926 [2018-11-12 19:03:56,476 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 338 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 19:03:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2018-11-12 19:03:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3800. [2018-11-12 19:03:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3800 states. [2018-11-12 19:03:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 4784 transitions. [2018-11-12 19:03:56,569 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 4784 transitions. Word has length 326 [2018-11-12 19:03:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:56,569 INFO L480 AbstractCegarLoop]: Abstraction has 3800 states and 4784 transitions. [2018-11-12 19:03:56,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 19:03:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 4784 transitions. [2018-11-12 19:03:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-11-12 19:03:56,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:56,583 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:03:56,584 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:56,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1749220112, now seen corresponding path program 1 times [2018-11-12 19:03:56,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:56,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:56,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:56,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:57,112 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:03:57,315 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:03:57,538 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:03:58,299 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-12 19:03:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 282 proven. 146 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:03:58,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:58,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:58,555 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 353 with the following transitions: [2018-11-12 19:03:58,555 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [598], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:03:58,560 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:58,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:58,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:58,759 INFO L272 AbstractInterpreter]: Visited 120 different actions 236 times. Merged at 5 different actions 7 times. Never widened. Performed 3019 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3019 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:03:58,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:58,767 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:59,163 INFO L227 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 78.48% of their original sizes. [2018-11-12 19:03:59,164 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:03:59,841 INFO L415 sIntCurrentIteration]: We unified 351 AI predicates to 351 [2018-11-12 19:03:59,841 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:03:59,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:03:59,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 31 [2018-11-12 19:03:59,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:59,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 19:03:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 19:03:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:03:59,843 INFO L87 Difference]: Start difference. First operand 3800 states and 4784 transitions. Second operand 18 states. [2018-11-12 19:04:04,996 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:10,196 INFO L93 Difference]: Finished difference Result 6083 states and 7991 transitions. [2018-11-12 19:04:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 19:04:10,196 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2018-11-12 19:04:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:10,213 INFO L225 Difference]: With dead ends: 6083 [2018-11-12 19:04:10,213 INFO L226 Difference]: Without dead ends: 4171 [2018-11-12 19:04:10,223 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 370 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 19:04:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2018-11-12 19:04:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 3985. [2018-11-12 19:04:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3985 states. [2018-11-12 19:04:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 4976 transitions. [2018-11-12 19:04:10,314 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 4976 transitions. Word has length 352 [2018-11-12 19:04:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:10,315 INFO L480 AbstractCegarLoop]: Abstraction has 3985 states and 4976 transitions. [2018-11-12 19:04:10,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 19:04:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 4976 transitions. [2018-11-12 19:04:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-12 19:04:10,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:10,330 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:04:10,330 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:10,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash -234942236, now seen corresponding path program 1 times [2018-11-12 19:04:10,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:10,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 282 proven. 146 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:04:11,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:11,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:11,041 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 363 with the following transitions: [2018-11-12 19:04:11,042 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [598], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:11,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:11,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:11,239 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:11,239 INFO L272 AbstractInterpreter]: Visited 130 different actions 253 times. Merged at 4 different actions 4 times. Never widened. Performed 3301 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3301 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:04:11,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:11,250 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:11,755 INFO L227 lantSequenceWeakener]: Weakened 73 states. On average, predicates are now at 79.14% of their original sizes. [2018-11-12 19:04:11,756 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:12,383 INFO L415 sIntCurrentIteration]: We unified 361 AI predicates to 361 [2018-11-12 19:04:12,384 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:12,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:12,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-11-12 19:04:12,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:12,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 19:04:12,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 19:04:12,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:04:12,386 INFO L87 Difference]: Start difference. First operand 3985 states and 4976 transitions. Second operand 19 states. [2018-11-12 19:04:20,476 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:33,564 INFO L93 Difference]: Finished difference Result 7241 states and 9396 transitions. [2018-11-12 19:04:33,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:04:33,564 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 362 [2018-11-12 19:04:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:33,585 INFO L225 Difference]: With dead ends: 7241 [2018-11-12 19:04:33,586 INFO L226 Difference]: Without dead ends: 5329 [2018-11-12 19:04:33,596 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 370 GetRequests, 337 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-12 19:04:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5329 states. [2018-11-12 19:04:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5329 to 5203. [2018-11-12 19:04:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5203 states. [2018-11-12 19:04:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 6277 transitions. [2018-11-12 19:04:33,723 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 6277 transitions. Word has length 362 [2018-11-12 19:04:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:33,724 INFO L480 AbstractCegarLoop]: Abstraction has 5203 states and 6277 transitions. [2018-11-12 19:04:33,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 19:04:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 6277 transitions. [2018-11-12 19:04:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-11-12 19:04:33,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:33,739 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:04:33,740 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:33,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash -785108, now seen corresponding path program 1 times [2018-11-12 19:04:33,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:33,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:33,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 338 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-12 19:04:34,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:34,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:34,321 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 367 with the following transitions: [2018-11-12 19:04:34,322 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:34,324 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:34,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:34,505 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:34,681 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:34,681 INFO L272 AbstractInterpreter]: Visited 120 different actions 362 times. Merged at 8 different actions 24 times. Never widened. Performed 3497 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 19:04:34,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:34,724 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:35,137 INFO L227 lantSequenceWeakener]: Weakened 363 states. On average, predicates are now at 80.68% of their original sizes. [2018-11-12 19:04:35,137 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:35,285 INFO L415 sIntCurrentIteration]: We unified 365 AI predicates to 365 [2018-11-12 19:04:35,286 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:35,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:35,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-12 19:04:35,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:35,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 19:04:35,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 19:04:35,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 19:04:35,288 INFO L87 Difference]: Start difference. First operand 5203 states and 6277 transitions. Second operand 10 states. [2018-11-12 19:04:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:39,963 INFO L93 Difference]: Finished difference Result 7883 states and 10208 transitions. [2018-11-12 19:04:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 19:04:39,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 366 [2018-11-12 19:04:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:39,987 INFO L225 Difference]: With dead ends: 7883 [2018-11-12 19:04:39,988 INFO L226 Difference]: Without dead ends: 5971 [2018-11-12 19:04:39,999 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 373 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:04:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2018-11-12 19:04:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 5949. [2018-11-12 19:04:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5949 states. [2018-11-12 19:04:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5949 states to 5949 states and 7227 transitions. [2018-11-12 19:04:40,129 INFO L78 Accepts]: Start accepts. Automaton has 5949 states and 7227 transitions. Word has length 366 [2018-11-12 19:04:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:40,130 INFO L480 AbstractCegarLoop]: Abstraction has 5949 states and 7227 transitions. [2018-11-12 19:04:40,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 19:04:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5949 states and 7227 transitions. [2018-11-12 19:04:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-12 19:04:40,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:40,150 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 19:04:40,150 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:40,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:40,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1733242284, now seen corresponding path program 1 times [2018-11-12 19:04:40,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:40,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:40,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:40,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:40,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 283 proven. 198 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:04:41,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:41,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:41,169 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 423 with the following transitions: [2018-11-12 19:04:41,169 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:41,172 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:41,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:41,230 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:41,433 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:41,434 INFO L272 AbstractInterpreter]: Visited 155 different actions 303 times. Merged at 4 different actions 4 times. Never widened. Performed 4193 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:04:41,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:41,441 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:42,057 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 78.54% of their original sizes. [2018-11-12 19:04:42,057 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:42,784 INFO L415 sIntCurrentIteration]: We unified 421 AI predicates to 421 [2018-11-12 19:04:42,784 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:42,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:42,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2018-11-12 19:04:42,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:42,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 19:04:42,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 19:04:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:04:42,786 INFO L87 Difference]: Start difference. First operand 5949 states and 7227 transitions. Second operand 19 states. [2018-11-12 19:05:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:06,767 INFO L93 Difference]: Finished difference Result 9948 states and 12608 transitions. [2018-11-12 19:05:06,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 19:05:06,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 422 [2018-11-12 19:05:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:06,792 INFO L225 Difference]: With dead ends: 9948 [2018-11-12 19:05:06,793 INFO L226 Difference]: Without dead ends: 7290 [2018-11-12 19:05:06,803 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 431 GetRequests, 397 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-11-12 19:05:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7290 states. [2018-11-12 19:05:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7290 to 6608. [2018-11-12 19:05:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6608 states. [2018-11-12 19:05:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6608 states to 6608 states and 7927 transitions. [2018-11-12 19:05:06,928 INFO L78 Accepts]: Start accepts. Automaton has 6608 states and 7927 transitions. Word has length 422 [2018-11-12 19:05:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:06,928 INFO L480 AbstractCegarLoop]: Abstraction has 6608 states and 7927 transitions. [2018-11-12 19:05:06,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 19:05:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6608 states and 7927 transitions. [2018-11-12 19:05:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-11-12 19:05:06,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:06,951 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:06,952 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:06,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1508456411, now seen corresponding path program 1 times [2018-11-12 19:05:06,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:06,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:06,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:06,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:06,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:07,377 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:05:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 270 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:05:08,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:08,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:08,084 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 436 with the following transitions: [2018-11-12 19:05:08,085 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:08,087 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:08,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:08,142 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:08,307 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:08,308 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Performed 3481 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3481 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:05:08,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:08,316 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:08,798 INFO L227 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 78.24% of their original sizes. [2018-11-12 19:05:08,798 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:09,326 INFO L415 sIntCurrentIteration]: We unified 434 AI predicates to 434 [2018-11-12 19:05:09,327 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:09,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [12] total 35 [2018-11-12 19:05:09,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:09,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 19:05:09,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 19:05:09,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-11-12 19:05:09,328 INFO L87 Difference]: Start difference. First operand 6608 states and 7927 transitions. Second operand 25 states. [2018-11-12 19:05:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:31,986 INFO L93 Difference]: Finished difference Result 10914 states and 13688 transitions. [2018-11-12 19:05:31,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 19:05:31,986 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 435 [2018-11-12 19:05:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:32,009 INFO L225 Difference]: With dead ends: 10914 [2018-11-12 19:05:32,009 INFO L226 Difference]: Without dead ends: 8256 [2018-11-12 19:05:32,021 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 447 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 19:05:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8256 states. [2018-11-12 19:05:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8256 to 7389. [2018-11-12 19:05:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7389 states. [2018-11-12 19:05:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 8754 transitions. [2018-11-12 19:05:32,164 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 8754 transitions. Word has length 435 [2018-11-12 19:05:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:32,164 INFO L480 AbstractCegarLoop]: Abstraction has 7389 states and 8754 transitions. [2018-11-12 19:05:32,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 19:05:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 8754 transitions. [2018-11-12 19:05:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-11-12 19:05:32,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:32,190 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:32,191 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:32,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1932287357, now seen corresponding path program 1 times [2018-11-12 19:05:32,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:32,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 258 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:05:33,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:33,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:33,779 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2018-11-12 19:05:33,779 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:33,782 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:33,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:33,883 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:34,071 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:34,071 INFO L272 AbstractInterpreter]: Visited 180 different actions 356 times. Merged at 5 different actions 7 times. Never widened. Performed 5035 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5035 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:05:34,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:34,078 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:34,580 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 77.33% of their original sizes. [2018-11-12 19:05:34,580 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:34,986 INFO L415 sIntCurrentIteration]: We unified 446 AI predicates to 446 [2018-11-12 19:05:34,986 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [14] total 31 [2018-11-12 19:05:34,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:34,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 19:05:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 19:05:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:05:34,989 INFO L87 Difference]: Start difference. First operand 7389 states and 8754 transitions. Second operand 19 states. [2018-11-12 19:05:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:54,006 INFO L93 Difference]: Finished difference Result 11140 states and 13815 transitions. [2018-11-12 19:05:54,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 19:05:54,007 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 447 [2018-11-12 19:05:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:54,029 INFO L225 Difference]: With dead ends: 11140 [2018-11-12 19:05:54,030 INFO L226 Difference]: Without dead ends: 8482 [2018-11-12 19:05:54,038 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 455 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2018-11-12 19:05:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8482 states. [2018-11-12 19:05:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8482 to 7962. [2018-11-12 19:05:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7962 states. [2018-11-12 19:05:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7962 states to 7962 states and 9364 transitions. [2018-11-12 19:05:54,174 INFO L78 Accepts]: Start accepts. Automaton has 7962 states and 9364 transitions. Word has length 447 [2018-11-12 19:05:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:54,175 INFO L480 AbstractCegarLoop]: Abstraction has 7962 states and 9364 transitions. [2018-11-12 19:05:54,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 19:05:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7962 states and 9364 transitions. [2018-11-12 19:05:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-11-12 19:05:54,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:54,200 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:54,200 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:54,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1083720045, now seen corresponding path program 1 times [2018-11-12 19:05:54,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:54,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:54,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:54,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-12 19:05:57,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:05:57,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:05:57,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:57,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:05:57,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:05:57,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:05:57,283 INFO L87 Difference]: Start difference. First operand 7962 states and 9364 transitions. Second operand 4 states. [2018-11-12 19:05:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:59,043 INFO L93 Difference]: Finished difference Result 14229 states and 17476 transitions. [2018-11-12 19:05:59,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:05:59,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 469 [2018-11-12 19:05:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:59,075 INFO L225 Difference]: With dead ends: 14229 [2018-11-12 19:05:59,075 INFO L226 Difference]: Without dead ends: 10359 [2018-11-12 19:05:59,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:05:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10359 states. [2018-11-12 19:05:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10359 to 10043. [2018-11-12 19:05:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10043 states. [2018-11-12 19:05:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10043 states to 10043 states and 11643 transitions. [2018-11-12 19:05:59,270 INFO L78 Accepts]: Start accepts. Automaton has 10043 states and 11643 transitions. Word has length 469 [2018-11-12 19:05:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:59,271 INFO L480 AbstractCegarLoop]: Abstraction has 10043 states and 11643 transitions. [2018-11-12 19:05:59,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:05:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 10043 states and 11643 transitions. [2018-11-12 19:05:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-11-12 19:05:59,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:59,293 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:59,293 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:59,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1412997856, now seen corresponding path program 1 times [2018-11-12 19:05:59,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:59,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:59,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:00,253 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:06:00,478 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:06:00,758 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:06:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 355 proven. 459 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:06:01,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:01,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:01,351 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 481 with the following transitions: [2018-11-12 19:06:01,351 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [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], [595], [599], [603], [607], [611], [614], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:01,352 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:01,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:01,404 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:01,570 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:01,571 INFO L272 AbstractInterpreter]: Visited 123 different actions 364 times. Merged at 7 different actions 17 times. Never widened. Performed 3571 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 19:06:01,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:01,581 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:02,076 INFO L227 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 77.67% of their original sizes. [2018-11-12 19:06:02,077 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:02,468 INFO L415 sIntCurrentIteration]: We unified 479 AI predicates to 479 [2018-11-12 19:06:02,469 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:02,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:02,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 30 [2018-11-12 19:06:02,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:02,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 19:06:02,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 19:06:02,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:06:02,470 INFO L87 Difference]: Start difference. First operand 10043 states and 11643 transitions. Second operand 17 states. [2018-11-12 19:06:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:21,905 INFO L93 Difference]: Finished difference Result 17861 states and 21249 transitions. [2018-11-12 19:06:21,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 19:06:21,905 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 480 [2018-11-12 19:06:21,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:21,941 INFO L225 Difference]: With dead ends: 17861 [2018-11-12 19:06:21,941 INFO L226 Difference]: Without dead ends: 13910 [2018-11-12 19:06:21,956 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 489 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-11-12 19:06:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13910 states. [2018-11-12 19:06:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13910 to 13520. [2018-11-12 19:06:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13520 states. [2018-11-12 19:06:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13520 states to 13520 states and 15435 transitions. [2018-11-12 19:06:22,176 INFO L78 Accepts]: Start accepts. Automaton has 13520 states and 15435 transitions. Word has length 480 [2018-11-12 19:06:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:22,177 INFO L480 AbstractCegarLoop]: Abstraction has 13520 states and 15435 transitions. [2018-11-12 19:06:22,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 19:06:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 13520 states and 15435 transitions. [2018-11-12 19:06:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-11-12 19:06:22,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:22,201 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:06:22,201 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:22,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2100298469, now seen corresponding path program 1 times [2018-11-12 19:06:22,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:22,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:22,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:22,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 478 proven. 299 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-12 19:06:23,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:23,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:23,472 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 570 with the following transitions: [2018-11-12 19:06:23,472 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], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [614], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:23,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:23,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:23,743 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:24,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:06:24,869 INFO L272 AbstractInterpreter]: Visited 191 different actions 958 times. Merged at 9 different actions 51 times. Widened at 1 different actions 2 times. Performed 12659 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12659 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 19:06:24,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:24,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:06:24,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:24,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:06:24,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:24,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:06:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:25,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:06:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-11-12 19:06:25,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:06:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-11-12 19:06:25,694 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:25,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [13] total 14 [2018-11-12 19:06:25,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:25,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:06:25,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:06:25,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-12 19:06:25,696 INFO L87 Difference]: Start difference. First operand 13520 states and 15435 transitions. Second operand 3 states. [2018-11-12 19:06:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:27,306 INFO L93 Difference]: Finished difference Result 18761 states and 22693 transitions. [2018-11-12 19:06:27,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:06:27,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 569 [2018-11-12 19:06:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:27,308 INFO L225 Difference]: With dead ends: 18761 [2018-11-12 19:06:27,308 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 19:06:27,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1150 GetRequests, 1137 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-12 19:06:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 19:06:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 19:06:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 19:06:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 19:06:27,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 569 [2018-11-12 19:06:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:27,344 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 19:06:27,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:06:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 19:06:27,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 19:06:27,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 19:06:27,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,735 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 74 [2018-11-12 19:06:27,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:06:27,891 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 137 [2018-11-12 19:06:28,481 WARN L179 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-11-12 19:06:28,611 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 Received shutdown request... [2018-11-12 19:06:30,172 WARN L187 SmtUtils]: Removed 5 from assertion stack [2018-11-12 19:06:30,172 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-11-12 19:06:30,174 INFO L168 Benchmark]: Toolchain (without parser) took 222140.87 ms. Allocated memory was 1.5 GB in the beginning and 4.9 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -928.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 19:06:30,175 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:06:30,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.31 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-12 19:06:30,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -855.9 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-12 19:06:30,177 INFO L168 Benchmark]: Boogie Preprocessor took 119.29 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:06:30,177 INFO L168 Benchmark]: RCFGBuilder took 3835.18 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: 141.6 MB). Peak memory consumption was 141.6 MB. Max. memory is 7.1 GB. [2018-11-12 19:06:30,178 INFO L168 Benchmark]: TraceAbstraction took 217209.78 ms. Allocated memory was 2.3 GB in the beginning and 4.9 GB in the end (delta: 2.6 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -256.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-12 19:06:30,183 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.26 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 842.31 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 129.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -855.9 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.29 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 3835.18 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: 141.6 MB). Peak memory consumption was 141.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217209.78 ms. Allocated memory was 2.3 GB in the beginning and 4.9 GB in the end (delta: 2.6 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -256.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 187]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 342. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown