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/Problem15_label58_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:51:40,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:51:40,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:51:40,221 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:51:40,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:51:40,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:51:40,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:51:40,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:51:40,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:51:40,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:51:40,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:51:40,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:51:40,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:51:40,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:51:40,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:51:40,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:51:40,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:51:40,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:51:40,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:51:40,240 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:51:40,241 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:51:40,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:51:40,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:51:40,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:51:40,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:51:40,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:51:40,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:51:40,248 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:51:40,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:51:40,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:51:40,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:51:40,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:51:40,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:51:40,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:51:40,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:51:40,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:51:40,254 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 01:51:40,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:51:40,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:51:40,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:51:40,288 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:51:40,289 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:51:40,289 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:51:40,289 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:51:40,290 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:51:40,290 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:51:40,290 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:51:40,290 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:51:40,290 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:51:40,290 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:51:40,291 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:51:40,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:51:40,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:51:40,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:51:40,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:51:40,293 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:51:40,293 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:51:40,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:51:40,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:51:40,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:51:40,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:51:40,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:51:40,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:51:40,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:51:40,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:51:40,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:51:40,295 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:51:40,295 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:51:40,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:51:40,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:51:40,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:51:40,296 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:51:40,296 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:51:40,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:51:40,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:51:40,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:51:40,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:51:40,385 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:51:40,387 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label58_true-unreach-call.c [2018-10-25 01:51:40,447 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84e93688b/ba962a2fb6e74922b174861fb54d768f/FLAGb183c9b0d [2018-10-25 01:51:41,166 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:51:41,167 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label58_true-unreach-call.c [2018-10-25 01:51:41,186 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84e93688b/ba962a2fb6e74922b174861fb54d768f/FLAGb183c9b0d [2018-10-25 01:51:41,203 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/84e93688b/ba962a2fb6e74922b174861fb54d768f [2018-10-25 01:51:41,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:51:41,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:51:41,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:51:41,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:51:41,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:51:41,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:51:41" (1/1) ... [2018-10-25 01:51:41,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3530b98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:41, skipping insertion in model container [2018-10-25 01:51:41,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:51:41" (1/1) ... [2018-10-25 01:51:41,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:51:41,355 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:51:42,090 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:51:42,095 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:51:42,404 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:51:42,429 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:51:42,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42 WrapperNode [2018-10-25 01:51:42,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:51:42,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:51:42,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:51:42,432 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:51:42,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:42,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:42,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:51:42,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:51:42,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:51:42,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:51:42,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:42,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:42,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:42,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:42,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:42,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:43,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (1/1) ... [2018-10-25 01:51:43,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:51:43,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:51:43,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:51:43,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:51:43,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (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 01:51:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:51:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:51:43,119 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:51:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:51:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:51:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:51:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:51:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:51:43,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:51:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:51:50,769 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:51:50,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:51:50 BoogieIcfgContainer [2018-10-25 01:51:50,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:51:50,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:51:50,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:51:50,777 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:51:50,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:51:41" (1/3) ... [2018-10-25 01:51:50,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131b9193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:51:50, skipping insertion in model container [2018-10-25 01:51:50,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:42" (2/3) ... [2018-10-25 01:51:50,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131b9193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:51:50, skipping insertion in model container [2018-10-25 01:51:50,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:51:50" (3/3) ... [2018-10-25 01:51:50,780 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label58_true-unreach-call.c [2018-10-25 01:51:50,791 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:51:50,801 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:51:50,820 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:51:50,873 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:51:50,874 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:51:50,874 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:51:50,874 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:51:50,874 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:51:50,874 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:51:50,875 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:51:50,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:51:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-25 01:51:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-25 01:51:50,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:51:50,942 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] [2018-10-25 01:51:50,945 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:51:50,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:51:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1265036959, now seen corresponding path program 1 times [2018-10-25 01:51:50,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:51:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:51,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:51:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:51,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:51:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:51:51,578 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-25 01:51:51,602 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 01:51:51,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:51:51,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:51:51,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:51:51,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:51:51,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:51:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:51:51,631 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-10-25 01:52:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:01,145 INFO L93 Difference]: Finished difference Result 1558 states and 2849 transitions. [2018-10-25 01:52:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:52:01,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-10-25 01:52:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:01,179 INFO L225 Difference]: With dead ends: 1558 [2018-10-25 01:52:01,180 INFO L226 Difference]: Without dead ends: 1114 [2018-10-25 01:52:01,191 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 01:52:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2018-10-25 01:52:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1091. [2018-10-25 01:52:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2018-10-25 01:52:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1853 transitions. [2018-10-25 01:52:01,325 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1853 transitions. Word has length 57 [2018-10-25 01:52:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:01,326 INFO L481 AbstractCegarLoop]: Abstraction has 1091 states and 1853 transitions. [2018-10-25 01:52:01,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:52:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1853 transitions. [2018-10-25 01:52:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 01:52:01,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:01,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:01,336 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:01,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:01,337 INFO L82 PathProgramCache]: Analyzing trace with hash 569089420, now seen corresponding path program 1 times [2018-10-25 01:52:01,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:01,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:01,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:01,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:01,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:52:01,710 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:01,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:52:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:52:01,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:52:01,713 INFO L87 Difference]: Start difference. First operand 1091 states and 1853 transitions. Second operand 5 states. [2018-10-25 01:52:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:11,192 INFO L93 Difference]: Finished difference Result 3240 states and 5580 transitions. [2018-10-25 01:52:11,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:52:11,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-10-25 01:52:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:11,212 INFO L225 Difference]: With dead ends: 3240 [2018-10-25 01:52:11,213 INFO L226 Difference]: Without dead ends: 2155 [2018-10-25 01:52:11,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:52:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2018-10-25 01:52:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2114. [2018-10-25 01:52:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2018-10-25 01:52:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3176 transitions. [2018-10-25 01:52:11,320 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3176 transitions. Word has length 130 [2018-10-25 01:52:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:11,320 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 3176 transitions. [2018-10-25 01:52:11,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:52:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3176 transitions. [2018-10-25 01:52:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-25 01:52:11,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:11,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:11,330 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:11,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash 139406748, now seen corresponding path program 1 times [2018-10-25 01:52:11,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:11,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:11,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:11,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:11,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:52:11,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:11,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:52:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:52:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:52:11,629 INFO L87 Difference]: Start difference. First operand 2114 states and 3176 transitions. Second operand 4 states. [2018-10-25 01:52:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:16,746 INFO L93 Difference]: Finished difference Result 7943 states and 12452 transitions. [2018-10-25 01:52:16,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:52:16,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-10-25 01:52:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:16,799 INFO L225 Difference]: With dead ends: 7943 [2018-10-25 01:52:16,799 INFO L226 Difference]: Without dead ends: 5835 [2018-10-25 01:52:16,824 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 01:52:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2018-10-25 01:52:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5835. [2018-10-25 01:52:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5835 states. [2018-10-25 01:52:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5835 states to 5835 states and 8168 transitions. [2018-10-25 01:52:16,997 INFO L78 Accepts]: Start accepts. Automaton has 5835 states and 8168 transitions. Word has length 138 [2018-10-25 01:52:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:16,997 INFO L481 AbstractCegarLoop]: Abstraction has 5835 states and 8168 transitions. [2018-10-25 01:52:16,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:52:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 5835 states and 8168 transitions. [2018-10-25 01:52:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-25 01:52:17,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:17,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:17,008 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:17,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash -23603164, now seen corresponding path program 1 times [2018-10-25 01:52:17,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:17,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:17,374 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:17,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:17,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:17,592 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:17,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:17,594 INFO L87 Difference]: Start difference. First operand 5835 states and 8168 transitions. Second operand 6 states. [2018-10-25 01:52:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:24,659 INFO L93 Difference]: Finished difference Result 15461 states and 22489 transitions. [2018-10-25 01:52:24,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:24,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2018-10-25 01:52:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:24,733 INFO L225 Difference]: With dead ends: 15461 [2018-10-25 01:52:24,734 INFO L226 Difference]: Without dead ends: 9632 [2018-10-25 01:52:24,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2018-10-25 01:52:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 9593. [2018-10-25 01:52:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9593 states. [2018-10-25 01:52:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9593 states to 9593 states and 13018 transitions. [2018-10-25 01:52:25,062 INFO L78 Accepts]: Start accepts. Automaton has 9593 states and 13018 transitions. Word has length 226 [2018-10-25 01:52:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:25,063 INFO L481 AbstractCegarLoop]: Abstraction has 9593 states and 13018 transitions. [2018-10-25 01:52:25,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9593 states and 13018 transitions. [2018-10-25 01:52:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-25 01:52:25,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:25,080 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:52:25,081 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:25,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1826308229, now seen corresponding path program 1 times [2018-10-25 01:52:25,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:25,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:25,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:25,348 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 100 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:52:25,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:52:25,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:52:25,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-10-25 01:52:25,776 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [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], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [625], [626], [630], [633], [638], [640], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-25 01:52:25,850 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:52:25,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:52:26,273 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:52:26,275 INFO L272 AbstractInterpreter]: Visited 90 different actions 90 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:52:26,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:26,318 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:52:26,914 INFO L232 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 78.13% of their original sizes. [2018-10-25 01:52:26,915 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:52:27,173 INFO L413 sIntCurrentIteration]: We have 226 unified AI predicates [2018-10-25 01:52:27,173 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:52:27,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:52:27,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:52:27,178 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:27,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:27,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:27,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:27,179 INFO L87 Difference]: Start difference. First operand 9593 states and 13018 transitions. Second operand 6 states. [2018-10-25 01:52:58,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:52:58,346 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: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 01:52:58,351 INFO L168 Benchmark]: Toolchain (without parser) took 77135.55 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:52:58,352 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-10-25 01:52:58,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1212.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:58,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 413.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -894.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:58,355 INFO L168 Benchmark]: Boogie Preprocessor took 197.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:58,356 INFO L168 Benchmark]: RCFGBuilder took 7726.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 327.0 MB). Peak memory consumption was 327.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:58,357 INFO L168 Benchmark]: TraceAbstraction took 67577.63 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.9 GB in the end (delta: -1.1 GB). Peak memory consumption was 811.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:58,362 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 1212.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 413.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -894.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 197.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7726.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 327.0 MB). Peak memory consumption was 327.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67577.63 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.9 GB in the end (delta: -1.1 GB). Peak memory consumption was 811.2 MB. 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...