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/Problem12_label14_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:37:19,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:37:19,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:37:19,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:37:19,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:37:19,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:37:19,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:37:19,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:37:19,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:37:19,301 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:37:19,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:37:19,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:37:19,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:37:19,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:37:19,305 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:37:19,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:37:19,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:37:19,309 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:37:19,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:37:19,313 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:37:19,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:37:19,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:37:19,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:37:19,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:37:19,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:37:19,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:37:19,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:37:19,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:37:19,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:37:19,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:37:19,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:37:19,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:37:19,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:37:19,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:37:19,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:37:19,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:37:19,327 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:37:19,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:37:19,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:37:19,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:37:19,357 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:37:19,358 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:37:19,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:37:19,358 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:37:19,358 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:37:19,358 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:37:19,359 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:37:19,359 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:37:19,359 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:37:19,360 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:37:19,360 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:37:19,361 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:37:19,362 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:37:19,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:37:19,362 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:37:19,362 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:37:19,362 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:37:19,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:37:19,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:37:19,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:37:19,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:37:19,363 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:37:19,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:37:19,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:37:19,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:37:19,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:37:19,367 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:37:19,367 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:37:19,367 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:37:19,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:37:19,367 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:37:19,368 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:37:19,368 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:37:19,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:37:19,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:37:19,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:37:19,443 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:37:19,443 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:37:19,444 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label14_true-unreach-call.c [2018-10-25 01:37:19,506 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f02637daf/30eb4ba0b670478b8cf0e4c9be70a9c1/FLAG2df822862 [2018-10-25 01:37:20,249 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:37:20,250 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label14_true-unreach-call.c [2018-10-25 01:37:20,280 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f02637daf/30eb4ba0b670478b8cf0e4c9be70a9c1/FLAG2df822862 [2018-10-25 01:37:20,297 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f02637daf/30eb4ba0b670478b8cf0e4c9be70a9c1 [2018-10-25 01:37:20,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:37:20,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:37:20,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:37:20,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:37:20,321 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:37:20,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:37:20" (1/1) ... [2018-10-25 01:37:20,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46764b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:20, skipping insertion in model container [2018-10-25 01:37:20,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:37:20" (1/1) ... [2018-10-25 01:37:20,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:37:20,491 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:37:21,852 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:37:21,857 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:37:22,463 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:37:22,501 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:37:22,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22 WrapperNode [2018-10-25 01:37:22,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:37:22,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:37:22,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:37:22,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:37:22,513 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:37:22" (1/1) ... [2018-10-25 01:37:22,586 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:37:22" (1/1) ... [2018-10-25 01:37:22,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:37:22,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:37:22,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:37:22,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:37:22,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (1/1) ... [2018-10-25 01:37:22,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (1/1) ... [2018-10-25 01:37:23,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (1/1) ... [2018-10-25 01:37:23,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (1/1) ... [2018-10-25 01:37:23,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (1/1) ... [2018-10-25 01:37:23,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (1/1) ... [2018-10-25 01:37:23,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (1/1) ... [2018-10-25 01:37:23,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:37:23,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:37:23,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:37:23,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:37:23,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (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:37:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:37:23,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:37:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:37:23,360 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:37:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:37:23,360 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:37:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:37:23,361 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:37:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:37:23,363 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:37:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:37:23,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:37:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:37:23,364 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:37:34,766 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:37:34,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:37:34 BoogieIcfgContainer [2018-10-25 01:37:34,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:37:34,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:37:34,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:37:34,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:37:34,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:37:20" (1/3) ... [2018-10-25 01:37:34,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef33c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:37:34, skipping insertion in model container [2018-10-25 01:37:34,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:22" (2/3) ... [2018-10-25 01:37:34,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef33c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:37:34, skipping insertion in model container [2018-10-25 01:37:34,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:37:34" (3/3) ... [2018-10-25 01:37:34,776 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label14_true-unreach-call.c [2018-10-25 01:37:34,785 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:37:34,796 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:37:34,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:37:34,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:37:34,862 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:37:34,862 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:37:34,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:37:34,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:37:34,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:37:34,862 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:37:34,863 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:37:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:37:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-25 01:37:34,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:34,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:37:34,920 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:34,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1198355269, now seen corresponding path program 1 times [2018-10-25 01:37:34,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:34,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:34,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:34,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:35,447 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:37:35,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:35,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:37:35,450 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:35,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:37:35,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:37:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:37:35,475 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 4 states. [2018-10-25 01:37:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:48,998 INFO L93 Difference]: Finished difference Result 3234 states and 6255 transitions. [2018-10-25 01:37:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:37:49,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-10-25 01:37:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:49,041 INFO L225 Difference]: With dead ends: 3234 [2018-10-25 01:37:49,041 INFO L226 Difference]: Without dead ends: 2388 [2018-10-25 01:37:49,051 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:37:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-10-25 01:37:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 1604. [2018-10-25 01:37:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:37:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2600 transitions. [2018-10-25 01:37:49,222 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2600 transitions. Word has length 55 [2018-10-25 01:37:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:49,223 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2600 transitions. [2018-10-25 01:37:49,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:37:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2600 transitions. [2018-10-25 01:37:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 01:37:49,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:49,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:49,232 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:49,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash -295662528, now seen corresponding path program 1 times [2018-10-25 01:37:49,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:49,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:49,234 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:49,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:49,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:37:49,491 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:49,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:37:49,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:37:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:37:49,495 INFO L87 Difference]: Start difference. First operand 1604 states and 2600 transitions. Second operand 5 states. [2018-10-25 01:38:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:05,396 INFO L93 Difference]: Finished difference Result 4873 states and 7923 transitions. [2018-10-25 01:38:05,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:38:05,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-10-25 01:38:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:05,426 INFO L225 Difference]: With dead ends: 4873 [2018-10-25 01:38:05,426 INFO L226 Difference]: Without dead ends: 3275 [2018-10-25 01:38:05,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2018-10-25 01:38:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3241. [2018-10-25 01:38:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2018-10-25 01:38:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4817 transitions. [2018-10-25 01:38:05,582 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4817 transitions. Word has length 135 [2018-10-25 01:38:05,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:05,583 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 4817 transitions. [2018-10-25 01:38:05,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:38:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4817 transitions. [2018-10-25 01:38:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-25 01:38:05,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:05,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:05,589 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:05,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:05,590 INFO L82 PathProgramCache]: Analyzing trace with hash 269121193, now seen corresponding path program 1 times [2018-10-25 01:38:05,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:05,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:05,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:05,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:05,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:38:05,817 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:05,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:05,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:05,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:05,819 INFO L87 Difference]: Start difference. First operand 3241 states and 4817 transitions. Second operand 6 states. [2018-10-25 01:38:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:17,738 INFO L93 Difference]: Finished difference Result 9804 states and 14878 transitions. [2018-10-25 01:38:17,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:17,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-25 01:38:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:17,774 INFO L225 Difference]: With dead ends: 9804 [2018-10-25 01:38:17,775 INFO L226 Difference]: Without dead ends: 6569 [2018-10-25 01:38:17,786 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:38:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6569 states. [2018-10-25 01:38:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6569 to 6495. [2018-10-25 01:38:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6495 states. [2018-10-25 01:38:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 9464 transitions. [2018-10-25 01:38:17,976 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 9464 transitions. Word has length 164 [2018-10-25 01:38:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:17,977 INFO L481 AbstractCegarLoop]: Abstraction has 6495 states and 9464 transitions. [2018-10-25 01:38:17,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 9464 transitions. [2018-10-25 01:38:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-25 01:38:17,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:17,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:17,981 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:17,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 960199113, now seen corresponding path program 1 times [2018-10-25 01:38:17,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:17,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:17,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:17,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:17,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:18,289 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:18,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:18,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:38:18,573 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:18,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:18,575 INFO L87 Difference]: Start difference. First operand 6495 states and 9464 transitions. Second operand 6 states. [2018-10-25 01:38:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:33,149 INFO L93 Difference]: Finished difference Result 21852 states and 33085 transitions. [2018-10-25 01:38:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:33,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2018-10-25 01:38:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:33,224 INFO L225 Difference]: With dead ends: 21852 [2018-10-25 01:38:33,230 INFO L226 Difference]: Without dead ends: 15363 [2018-10-25 01:38:33,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:38:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15363 states. [2018-10-25 01:38:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15363 to 15280. [2018-10-25 01:38:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15280 states. [2018-10-25 01:38:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15280 states to 15280 states and 21381 transitions. [2018-10-25 01:38:33,621 INFO L78 Accepts]: Start accepts. Automaton has 15280 states and 21381 transitions. Word has length 180 [2018-10-25 01:38:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:33,622 INFO L481 AbstractCegarLoop]: Abstraction has 15280 states and 21381 transitions. [2018-10-25 01:38:33,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 15280 states and 21381 transitions. [2018-10-25 01:38:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-25 01:38:33,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:33,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:33,628 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:33,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:33,629 INFO L82 PathProgramCache]: Analyzing trace with hash -178064156, now seen corresponding path program 1 times [2018-10-25 01:38:33,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:33,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:33,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:33,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:33,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:33,980 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 01:38:34,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:38:34,157 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:38:34,158 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-10-25 01:38:34,162 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2207], [2209], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:38:34,237 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:38:34,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:38:35,737 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:38:35,739 INFO L272 AbstractInterpreter]: Visited 153 different actions 300 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:38:35,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:35,783 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:38:37,236 INFO L232 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 79.03% of their original sizes. [2018-10-25 01:38:37,237 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:38:38,666 INFO L413 sIntCurrentIteration]: We have 200 unified AI predicates [2018-10-25 01:38:38,666 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:38:38,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:38:38,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-25 01:38:38,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:38,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 01:38:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 01:38:38,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-25 01:38:38,669 INFO L87 Difference]: Start difference. First operand 15280 states and 21381 transitions. Second operand 14 states. [2018-10-25 01:39:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 01:39:01,465 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:93) 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: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:39:01,470 INFO L168 Benchmark]: Toolchain (without parser) took 101160.18 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 851.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:01,472 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:39:01,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2188.80 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:01,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 476.64 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 814.2 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:01,474 INFO L168 Benchmark]: Boogie Preprocessor took 300.66 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:01,475 INFO L168 Benchmark]: RCFGBuilder took 11486.49 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 172.0 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -177.0 MB). Peak memory consumption was 666.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:01,476 INFO L168 Benchmark]: TraceAbstraction took 86701.39 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.1 GB). Free memory was 2.4 GB in the beginning and 2.7 GB in the end (delta: -285.5 MB). Peak memory consumption was 858.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:01,482 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 2188.80 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 476.64 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 814.2 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 300.66 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11486.49 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 172.0 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -177.0 MB). Peak memory consumption was 666.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86701.39 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.1 GB). Free memory was 2.4 GB in the beginning and 2.7 GB in the end (delta: -285.5 MB). Peak memory consumption was 858.0 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...