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/Problem13_label13_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:41:32,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:41:32,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:41:32,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:41:32,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:41:32,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:41:32,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:41:32,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:41:32,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:41:32,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:41:32,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:41:32,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:41:32,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:41:32,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:41:32,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:41:32,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:41:32,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:41:32,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:41:32,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:41:32,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:41:32,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:41:32,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:41:32,855 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:41:32,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:41:32,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:41:32,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:41:32,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:41:32,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:41:32,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:41:32,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:41:32,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:41:32,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:41:32,861 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:41:32,861 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:41:32,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:41:32,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:41:32,863 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:41:32,888 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:41:32,888 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:41:32,889 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:41:32,889 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:41:32,890 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:41:32,890 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:41:32,890 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:41:32,890 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:41:32,890 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:41:32,891 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:41:32,891 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:41:32,891 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:41:32,891 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:41:32,891 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:41:32,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:41:32,892 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:41:32,892 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:41:32,893 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:41:32,893 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:41:32,893 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:41:32,893 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:41:32,893 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:41:32,894 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:41:32,894 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:41:32,894 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:41:32,894 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:41:32,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:41:32,895 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:41:32,895 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:41:32,895 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:41:32,895 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:41:32,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:41:32,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:41:32,896 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:41:32,896 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:41:32,896 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:41:32,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:41:32,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:41:32,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:41:32,967 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:41:32,967 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:41:32,968 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label13_true-unreach-call.c [2018-10-25 01:41:33,027 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b2bb5cf29/813dc777f17b4685b1f23f6a2bf10084/FLAG34fd55c5a [2018-10-25 01:41:33,856 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:41:33,857 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label13_true-unreach-call.c [2018-10-25 01:41:33,898 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b2bb5cf29/813dc777f17b4685b1f23f6a2bf10084/FLAG34fd55c5a [2018-10-25 01:41:33,922 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b2bb5cf29/813dc777f17b4685b1f23f6a2bf10084 [2018-10-25 01:41:33,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:41:33,938 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:41:33,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:33,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:41:33,947 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:41:33,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:33" (1/1) ... [2018-10-25 01:41:33,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b40bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:33, skipping insertion in model container [2018-10-25 01:41:33,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:33" (1/1) ... [2018-10-25 01:41:33,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:41:34,142 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:41:35,709 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:35,714 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:41:36,449 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:36,487 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:41:36,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36 WrapperNode [2018-10-25 01:41:36,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:36,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:36,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:41:36,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:41:36,499 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:41:36" (1/1) ... [2018-10-25 01:41:36,583 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:41:36" (1/1) ... [2018-10-25 01:41:37,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:37,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:41:37,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:41:37,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:41:37,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (1/1) ... [2018-10-25 01:41:37,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (1/1) ... [2018-10-25 01:41:37,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (1/1) ... [2018-10-25 01:41:37,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (1/1) ... [2018-10-25 01:41:37,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (1/1) ... [2018-10-25 01:41:37,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (1/1) ... [2018-10-25 01:41:37,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (1/1) ... [2018-10-25 01:41:37,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:41:37,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:41:37,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:41:37,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:41:37,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (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:41:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:41:37,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:41:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:41:37,495 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:41:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:41:37,496 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:41:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:41:37,496 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:41:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:41:37,498 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:41:37,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:41:37,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:41:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:41:37,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:41:48,138 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:41:48,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:48 BoogieIcfgContainer [2018-10-25 01:41:48,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:41:48,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:41:48,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:41:48,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:41:48,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:41:33" (1/3) ... [2018-10-25 01:41:48,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790bc0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:48, skipping insertion in model container [2018-10-25 01:41:48,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:36" (2/3) ... [2018-10-25 01:41:48,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790bc0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:48, skipping insertion in model container [2018-10-25 01:41:48,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:48" (3/3) ... [2018-10-25 01:41:48,147 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label13_true-unreach-call.c [2018-10-25 01:41:48,157 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:41:48,167 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:41:48,183 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:41:48,229 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:41:48,229 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:41:48,229 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:41:48,229 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:41:48,229 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:41:48,229 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:41:48,230 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:41:48,230 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:41:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:41:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-25 01:41:48,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:48,289 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] [2018-10-25 01:41:48,291 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:48,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1465464788, now seen corresponding path program 1 times [2018-10-25 01:41:48,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:48,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:48,351 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:48,849 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:41:48,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:48,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:41:48,852 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:48,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:41:48,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:41:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:41:48,878 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-25 01:42:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:03,906 INFO L93 Difference]: Finished difference Result 4063 states and 7611 transitions. [2018-10-25 01:42:03,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:42:03,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-10-25 01:42:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:03,965 INFO L225 Difference]: With dead ends: 4063 [2018-10-25 01:42:03,965 INFO L226 Difference]: Without dead ends: 2937 [2018-10-25 01:42:03,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:42:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2018-10-25 01:42:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1982. [2018-10-25 01:42:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-10-25 01:42:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3456 transitions. [2018-10-25 01:42:04,178 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3456 transitions. Word has length 64 [2018-10-25 01:42:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:04,179 INFO L481 AbstractCegarLoop]: Abstraction has 1982 states and 3456 transitions. [2018-10-25 01:42:04,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:42:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3456 transitions. [2018-10-25 01:42:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 01:42:04,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:04,187 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, 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:42:04,188 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:04,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:04,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1113995663, now seen corresponding path program 1 times [2018-10-25 01:42:04,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:04,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:04,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:04,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:04,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:04,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:04,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:42:04,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:04,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:04,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:04,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:04,645 INFO L87 Difference]: Start difference. First operand 1982 states and 3456 transitions. Second operand 6 states. [2018-10-25 01:42:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:22,194 INFO L93 Difference]: Finished difference Result 7277 states and 13063 transitions. [2018-10-25 01:42:22,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:42:22,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-25 01:42:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:22,226 INFO L225 Difference]: With dead ends: 7277 [2018-10-25 01:42:22,227 INFO L226 Difference]: Without dead ends: 5301 [2018-10-25 01:42:22,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:42:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2018-10-25 01:42:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5252. [2018-10-25 01:42:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2018-10-25 01:42:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8253 transitions. [2018-10-25 01:42:22,403 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8253 transitions. Word has length 135 [2018-10-25 01:42:22,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:22,406 INFO L481 AbstractCegarLoop]: Abstraction has 5252 states and 8253 transitions. [2018-10-25 01:42:22,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8253 transitions. [2018-10-25 01:42:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-25 01:42:22,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:22,415 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, 1, 1, 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:42:22,415 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:22,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:22,416 INFO L82 PathProgramCache]: Analyzing trace with hash -303243424, now seen corresponding path program 1 times [2018-10-25 01:42:22,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:22,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:22,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:22,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:22,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:22,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:22,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:42:22,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:22,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:42:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:42:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:42:22,688 INFO L87 Difference]: Start difference. First operand 5252 states and 8253 transitions. Second operand 6 states. [2018-10-25 01:42:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:35,672 INFO L93 Difference]: Finished difference Result 13914 states and 22498 transitions. [2018-10-25 01:42:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:42:35,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-10-25 01:42:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:35,714 INFO L225 Difference]: With dead ends: 13914 [2018-10-25 01:42:35,714 INFO L226 Difference]: Without dead ends: 8668 [2018-10-25 01:42:35,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:42:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8668 states. [2018-10-25 01:42:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8668 to 8605. [2018-10-25 01:42:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8605 states. [2018-10-25 01:42:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8605 states to 8605 states and 12803 transitions. [2018-10-25 01:42:35,936 INFO L78 Accepts]: Start accepts. Automaton has 8605 states and 12803 transitions. Word has length 138 [2018-10-25 01:42:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:35,937 INFO L481 AbstractCegarLoop]: Abstraction has 8605 states and 12803 transitions. [2018-10-25 01:42:35,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:42:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 8605 states and 12803 transitions. [2018-10-25 01:42:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 01:42:35,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:35,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:35,941 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:35,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1626850484, now seen corresponding path program 1 times [2018-10-25 01:42:35,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:35,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:35,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:35,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:35,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:36,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:36,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:42:36,215 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:36,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:42:36,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:42:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:42:36,217 INFO L87 Difference]: Start difference. First operand 8605 states and 12803 transitions. Second operand 5 states. [2018-10-25 01:42:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:50,223 INFO L93 Difference]: Finished difference Result 25982 states and 40339 transitions. [2018-10-25 01:42:50,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:42:50,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2018-10-25 01:42:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:50,304 INFO L225 Difference]: With dead ends: 25982 [2018-10-25 01:42:50,304 INFO L226 Difference]: Without dead ends: 17383 [2018-10-25 01:42:50,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:42:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17383 states. [2018-10-25 01:42:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17383 to 17120. [2018-10-25 01:42:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17120 states. [2018-10-25 01:42:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17120 states to 17120 states and 24327 transitions. [2018-10-25 01:42:50,772 INFO L78 Accepts]: Start accepts. Automaton has 17120 states and 24327 transitions. Word has length 148 [2018-10-25 01:42:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:50,772 INFO L481 AbstractCegarLoop]: Abstraction has 17120 states and 24327 transitions. [2018-10-25 01:42:50,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:42:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17120 states and 24327 transitions. [2018-10-25 01:42:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-25 01:42:50,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:50,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,777 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:50,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:50,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2091389760, now seen corresponding path program 1 times [2018-10-25 01:42:50,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:50,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:50,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:50,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:50,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:51,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:42:51,000 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:51,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:42:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:42:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:42:51,002 INFO L87 Difference]: Start difference. First operand 17120 states and 24327 transitions. Second operand 4 states. [2018-10-25 01:43:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:05,982 INFO L93 Difference]: Finished difference Result 41873 states and 62405 transitions. [2018-10-25 01:43:05,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:43:05,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-10-25 01:43:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:06,101 INFO L225 Difference]: With dead ends: 41873 [2018-10-25 01:43:06,101 INFO L226 Difference]: Without dead ends: 24759 [2018-10-25 01:43:06,160 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:43:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24759 states. [2018-10-25 01:43:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24759 to 24713. [2018-10-25 01:43:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24713 states. [2018-10-25 01:43:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24713 states to 24713 states and 35498 transitions. [2018-10-25 01:43:06,742 INFO L78 Accepts]: Start accepts. Automaton has 24713 states and 35498 transitions. Word has length 165 [2018-10-25 01:43:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:06,743 INFO L481 AbstractCegarLoop]: Abstraction has 24713 states and 35498 transitions. [2018-10-25 01:43:06,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:43:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24713 states and 35498 transitions. [2018-10-25 01:43:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-25 01:43:06,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:06,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:06,751 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:06,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1502543096, now seen corresponding path program 1 times [2018-10-25 01:43:06,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:06,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:06,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:06,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:06,993 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:07,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:07,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:07,387 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:07,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:07,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:07,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:07,388 INFO L87 Difference]: Start difference. First operand 24713 states and 35498 transitions. Second operand 6 states. [2018-10-25 01:43:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:17,157 INFO L93 Difference]: Finished difference Result 66963 states and 107781 transitions. [2018-10-25 01:43:17,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:17,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-10-25 01:43:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:17,345 INFO L225 Difference]: With dead ends: 66963 [2018-10-25 01:43:17,345 INFO L226 Difference]: Without dead ends: 42256 [2018-10-25 01:43:17,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:43:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42256 states. [2018-10-25 01:43:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42256 to 42109. [2018-10-25 01:43:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42109 states. [2018-10-25 01:43:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42109 states to 42109 states and 62366 transitions. [2018-10-25 01:43:18,418 INFO L78 Accepts]: Start accepts. Automaton has 42109 states and 62366 transitions. Word has length 174 [2018-10-25 01:43:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:18,419 INFO L481 AbstractCegarLoop]: Abstraction has 42109 states and 62366 transitions. [2018-10-25 01:43:18,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 42109 states and 62366 transitions. [2018-10-25 01:43:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-25 01:43:18,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:18,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:18,438 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:18,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:18,439 INFO L82 PathProgramCache]: Analyzing trace with hash -621888907, now seen corresponding path program 1 times [2018-10-25 01:43:18,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:18,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:18,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:18,447 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:18,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:18,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:18,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:18,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:18,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:18,747 INFO L87 Difference]: Start difference. First operand 42109 states and 62366 transitions. Second operand 6 states. [2018-10-25 01:43:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:36,112 INFO L93 Difference]: Finished difference Result 140383 states and 243473 transitions. [2018-10-25 01:43:36,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:43:36,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 222 [2018-10-25 01:43:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:36,830 INFO L225 Difference]: With dead ends: 140383 [2018-10-25 01:43:36,831 INFO L226 Difference]: Without dead ends: 98280 [2018-10-25 01:43:37,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:43:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98280 states. [2018-10-25 01:43:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98280 to 97738. [2018-10-25 01:43:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97738 states. [2018-10-25 01:43:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97738 states to 97738 states and 144373 transitions. [2018-10-25 01:43:40,064 INFO L78 Accepts]: Start accepts. Automaton has 97738 states and 144373 transitions. Word has length 222 [2018-10-25 01:43:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:40,065 INFO L481 AbstractCegarLoop]: Abstraction has 97738 states and 144373 transitions. [2018-10-25 01:43:40,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 97738 states and 144373 transitions. [2018-10-25 01:43:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-25 01:43:40,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:40,102 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:43:40,102 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:40,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:40,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1548106794, now seen corresponding path program 1 times [2018-10-25 01:43:40,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:40,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:40,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:40,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:40,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:40,435 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:43:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 222 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:40,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:43:40,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:43:40,772 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-10-25 01:43:40,774 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3308], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3361], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:43:40,843 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:43:40,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:43:41,417 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:43:41,418 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:43:41,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:41,463 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:43:42,222 INFO L232 lantSequenceWeakener]: Weakened 284 states. On average, predicates are now at 71.42% of their original sizes. [2018-10-25 01:43:42,222 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:43:42,486 INFO L413 sIntCurrentIteration]: We have 294 unified AI predicates [2018-10-25 01:43:42,487 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:43:42,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:43:42,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:43:42,488 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:42,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:42,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:42,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:42,489 INFO L87 Difference]: Start difference. First operand 97738 states and 144373 transitions. Second operand 6 states. [2018-10-25 01:43:46,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:43:46,006 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:93) 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.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) 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:43:46,012 INFO L168 Benchmark]: Toolchain (without parser) took 132076.52 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -158.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-25 01:43:46,013 INFO L168 Benchmark]: CDTParser took 0.21 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:43:46,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2548.97 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:46,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 586.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 817.4 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:46,016 INFO L168 Benchmark]: Boogie Preprocessor took 340.85 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: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:46,017 INFO L168 Benchmark]: RCFGBuilder took 10723.02 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 179.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 31.7 MB). Peak memory consumption was 652.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:43:46,018 INFO L168 Benchmark]: TraceAbstraction took 117870.85 ms. Allocated memory was 2.5 GB in the beginning and 3.6 GB in the end (delta: 1.0 GB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 600.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-25 01:43:46,023 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.21 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 2548.97 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 586.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 817.4 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 340.85 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: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10723.02 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 179.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 31.7 MB). Peak memory consumption was 652.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117870.85 ms. Allocated memory was 2.5 GB in the beginning and 3.6 GB in the end (delta: 1.0 GB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 600.7 MB). Peak memory consumption was 1.6 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...