java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label51_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:07:44,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:07:44,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:07:44,139 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:07:44,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:07:44,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:07:44,143 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:07:44,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:07:44,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:07:44,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:07:44,152 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:07:44,152 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:07:44,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:07:44,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:07:44,166 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:07:44,166 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:07:44,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:07:44,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:07:44,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:07:44,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:07:44,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:07:44,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:07:44,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:07:44,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:07:44,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:07:44,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:07:44,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:07:44,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:07:44,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:07:44,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:07:44,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:07:44,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:07:44,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:07:44,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:07:44,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:07:44,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:07:44,199 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 02:07:44,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:07:44,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:07:44,229 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:07:44,230 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:07:44,230 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:07:44,230 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:07:44,230 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:07:44,230 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:07:44,231 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:07:44,231 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:07:44,231 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:07:44,231 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:07:44,231 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:07:44,231 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:07:44,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:07:44,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:07:44,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:07:44,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:07:44,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:07:44,234 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:07:44,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:07:44,236 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:07:44,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:07:44,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:07:44,237 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:07:44,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:07:44,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:07:44,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:07:44,237 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:07:44,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:07:44,238 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:07:44,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:07:44,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:07:44,238 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:07:44,238 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:07:44,239 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:07:44,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:07:44,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:07:44,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:07:44,316 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:07:44,316 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:07:44,317 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label51_true-unreach-call.c [2018-10-25 02:07:44,398 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e64104d24/7919b768caa344e2aae9f7c0dba13d2f/FLAG913e63dce [2018-10-25 02:07:45,181 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:07:45,182 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label51_true-unreach-call.c [2018-10-25 02:07:45,211 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e64104d24/7919b768caa344e2aae9f7c0dba13d2f/FLAG913e63dce [2018-10-25 02:07:45,231 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e64104d24/7919b768caa344e2aae9f7c0dba13d2f [2018-10-25 02:07:45,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:07:45,244 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:07:45,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:07:45,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:07:45,249 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:07:45,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:07:45" (1/1) ... [2018-10-25 02:07:45,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a37ae9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:45, skipping insertion in model container [2018-10-25 02:07:45,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:07:45" (1/1) ... [2018-10-25 02:07:45,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:07:45,382 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:07:46,436 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:07:46,440 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:07:46,908 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:07:46,938 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:07:46,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46 WrapperNode [2018-10-25 02:07:46,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:07:46,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:07:46,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:07:46,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:07:46,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:07:47,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:07:47,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:07:47,380 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:07:47,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... [2018-10-25 02:07:47,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:07:47,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:07:47,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:07:47,638 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:07:47,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 02:07:47,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:07:47,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:07:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 02:07:47,711 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 02:07:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 02:07:47,712 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 02:07:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 02:07:47,712 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 02:07:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:07:47,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:07:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:07:47,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:07:55,881 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:07:55,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:07:55 BoogieIcfgContainer [2018-10-25 02:07:55,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:07:55,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:07:55,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:07:55,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:07:55,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:07:45" (1/3) ... [2018-10-25 02:07:55,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511c9fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:07:55, skipping insertion in model container [2018-10-25 02:07:55,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:07:46" (2/3) ... [2018-10-25 02:07:55,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511c9fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:07:55, skipping insertion in model container [2018-10-25 02:07:55,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:07:55" (3/3) ... [2018-10-25 02:07:55,901 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label51_true-unreach-call.c [2018-10-25 02:07:55,911 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:07:55,921 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:07:55,941 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:07:56,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:07:56,001 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:07:56,001 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:07:56,001 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:07:56,001 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:07:56,001 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:07:56,002 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:07:56,002 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:07:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-25 02:07:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-25 02:07:56,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:07:56,062 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] [2018-10-25 02:07:56,065 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:07:56,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:07:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash -198133833, now seen corresponding path program 1 times [2018-10-25 02:07:56,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:07:56,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:56,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:07:56,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:07:56,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:07:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:07:56,675 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-25 02:07:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:07:56,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:07:56,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:07:56,702 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:07:56,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:07:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:07:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:07:56,730 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 4 states. [2018-10-25 02:08:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:08,185 INFO L93 Difference]: Finished difference Result 2974 states and 5747 transitions. [2018-10-25 02:08:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:08:08,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-25 02:08:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:08,227 INFO L225 Difference]: With dead ends: 2974 [2018-10-25 02:08:08,227 INFO L226 Difference]: Without dead ends: 2193 [2018-10-25 02:08:08,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:08:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-10-25 02:08:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2193. [2018-10-25 02:08:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2018-10-25 02:08:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3506 transitions. [2018-10-25 02:08:08,464 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3506 transitions. Word has length 67 [2018-10-25 02:08:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:08,465 INFO L481 AbstractCegarLoop]: Abstraction has 2193 states and 3506 transitions. [2018-10-25 02:08:08,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:08:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3506 transitions. [2018-10-25 02:08:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-25 02:08:08,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:08,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:08:08,483 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:08,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:08,484 INFO L82 PathProgramCache]: Analyzing trace with hash 228041992, now seen corresponding path program 1 times [2018-10-25 02:08:08,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:08,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:08,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:08,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:08,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:08,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 02:08:08,844 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:08,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:08:08,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:08:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:08:08,847 INFO L87 Difference]: Start difference. First operand 2193 states and 3506 transitions. Second operand 5 states. [2018-10-25 02:08:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:17,816 INFO L93 Difference]: Finished difference Result 6600 states and 10738 transitions. [2018-10-25 02:08:17,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:08:17,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-25 02:08:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:17,851 INFO L225 Difference]: With dead ends: 6600 [2018-10-25 02:08:17,851 INFO L226 Difference]: Without dead ends: 4413 [2018-10-25 02:08:17,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:08:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2018-10-25 02:08:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4378. [2018-10-25 02:08:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4378 states. [2018-10-25 02:08:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 6712 transitions. [2018-10-25 02:08:18,012 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 6712 transitions. Word has length 137 [2018-10-25 02:08:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:18,013 INFO L481 AbstractCegarLoop]: Abstraction has 4378 states and 6712 transitions. [2018-10-25 02:08:18,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:08:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 6712 transitions. [2018-10-25 02:08:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-25 02:08:18,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:18,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 02:08:18,027 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:18,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1314809025, now seen corresponding path program 1 times [2018-10-25 02:08:18,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:18,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:18,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:18,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:18,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:18,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:08:18,328 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:18,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:18,330 INFO L87 Difference]: Start difference. First operand 4378 states and 6712 transitions. Second operand 6 states. [2018-10-25 02:08:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:26,658 INFO L93 Difference]: Finished difference Result 15364 states and 24184 transitions. [2018-10-25 02:08:26,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:08:26,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-25 02:08:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:26,820 INFO L225 Difference]: With dead ends: 15364 [2018-10-25 02:08:26,821 INFO L226 Difference]: Without dead ends: 10992 [2018-10-25 02:08:26,844 INFO L605 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-10-25 02:08:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10992 states. [2018-10-25 02:08:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10992 to 10926. [2018-10-25 02:08:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10926 states. [2018-10-25 02:08:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10926 states to 10926 states and 15805 transitions. [2018-10-25 02:08:27,139 INFO L78 Accepts]: Start accepts. Automaton has 10926 states and 15805 transitions. Word has length 164 [2018-10-25 02:08:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:27,140 INFO L481 AbstractCegarLoop]: Abstraction has 10926 states and 15805 transitions. [2018-10-25 02:08:27,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:08:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 10926 states and 15805 transitions. [2018-10-25 02:08:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-25 02:08:27,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:27,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 02:08:27,149 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:27,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:27,151 INFO L82 PathProgramCache]: Analyzing trace with hash -446989259, now seen corresponding path program 1 times [2018-10-25 02:08:27,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:27,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:27,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:27,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:27,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:08:27,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:08:27,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:08:27,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:27,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:08:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:08:27,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:08:27,420 INFO L87 Difference]: Start difference. First operand 10926 states and 15805 transitions. Second operand 4 states. [2018-10-25 02:08:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:08:34,355 INFO L93 Difference]: Finished difference Result 26109 states and 38076 transitions. [2018-10-25 02:08:34,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:08:34,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-10-25 02:08:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:08:34,434 INFO L225 Difference]: With dead ends: 26109 [2018-10-25 02:08:34,435 INFO L226 Difference]: Without dead ends: 15189 [2018-10-25 02:08:34,479 INFO L605 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-10-25 02:08:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15189 states. [2018-10-25 02:08:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15189 to 15183. [2018-10-25 02:08:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15183 states. [2018-10-25 02:08:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15183 states to 15183 states and 19641 transitions. [2018-10-25 02:08:35,133 INFO L78 Accepts]: Start accepts. Automaton has 15183 states and 19641 transitions. Word has length 174 [2018-10-25 02:08:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:08:35,134 INFO L481 AbstractCegarLoop]: Abstraction has 15183 states and 19641 transitions. [2018-10-25 02:08:35,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:08:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 15183 states and 19641 transitions. [2018-10-25 02:08:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-25 02:08:35,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:08:35,141 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, 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] [2018-10-25 02:08:35,142 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:08:35,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1032798605, now seen corresponding path program 1 times [2018-10-25 02:08:35,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:08:35,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:35,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:08:35,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:08:35,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:08:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:08:35,414 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:08:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 120 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:08:35,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:08:35,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:08:35,662 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2018-10-25 02:08:35,664 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1839], [1847], [1855], [1863], [1871], [1879], [1887], [1895], [1903], [1911], [1919], [1927], [1935], [1943], [1951], [1959], [1967], [1975], [1983], [1991], [1999], [2007], [2015], [2023], [2031], [2039], [2047], [2055], [2059], [2061], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2144], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2216], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-25 02:08:35,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:08:35,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:08:36,109 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 02:08:36,115 INFO L272 AbstractInterpreter]: Visited 100 different actions 100 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 02:08:36,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:08:36,126 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 02:08:36,693 INFO L232 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 78.28% of their original sizes. [2018-10-25 02:08:36,693 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 02:08:36,777 INFO L413 sIntCurrentIteration]: We have 238 unified AI predicates [2018-10-25 02:08:36,777 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 02:08:36,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:08:36,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 02:08:36,783 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:08:36,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:08:36,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:08:36,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:08:36,784 INFO L87 Difference]: Start difference. First operand 15183 states and 19641 transitions. Second operand 6 states. [2018-10-25 02:09:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:09:28,709 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 02:09:28,715 INFO L168 Benchmark]: Toolchain (without parser) took 103472.24 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -205.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-25 02:09:28,716 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 02:09:28,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1694.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:09:28,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 438.89 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -885.8 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:09:28,719 INFO L168 Benchmark]: Boogie Preprocessor took 257.60 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2018-10-25 02:09:28,720 INFO L168 Benchmark]: RCFGBuilder took 8245.05 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 510.6 MB). Peak memory consumption was 510.6 MB. Max. memory is 7.1 GB. [2018-10-25 02:09:28,721 INFO L168 Benchmark]: TraceAbstraction took 92830.54 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 7.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-25 02:09:28,726 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1694.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 438.89 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -885.8 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 257.60 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8245.05 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 510.6 MB). Peak memory consumption was 510.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92830.54 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 7.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...