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_label36_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:38:52,722 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:38:52,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:38:52,737 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:38:52,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:38:52,738 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:38:52,739 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:38:52,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:38:52,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:38:52,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:38:52,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:38:52,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:38:52,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:38:52,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:38:52,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:38:52,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:38:52,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:38:52,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:38:52,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:38:52,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:38:52,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:38:52,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:38:52,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:38:52,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:38:52,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:38:52,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:38:52,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:38:52,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:38:52,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:38:52,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:38:52,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:38:52,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:38:52,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:38:52,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:38:52,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:38:52,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:38:52,787 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:38:52,819 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:38:52,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:38:52,821 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:38:52,821 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:38:52,821 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:38:52,821 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:38:52,821 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:38:52,822 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:38:52,822 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:38:52,823 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:38:52,823 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:38:52,823 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:38:52,823 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:38:52,823 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:38:52,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:38:52,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:38:52,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:38:52,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:38:52,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:38:52,825 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:38:52,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:38:52,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:38:52,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:38:52,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:38:52,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:38:52,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:38:52,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:38:52,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:38:52,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:38:52,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:38:52,829 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:38:52,829 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:38:52,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:38:52,829 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:38:52,830 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:38:52,830 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:38:52,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:38:52,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:38:52,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:38:52,925 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:38:52,926 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:38:52,927 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label36_true-unreach-call.c [2018-10-25 01:38:52,994 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6cc1b7fa2/ecc750a35d0840c09d6ad0a38b63018c/FLAGc08b9bce6 [2018-10-25 01:38:53,837 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:38:53,838 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label36_true-unreach-call.c [2018-10-25 01:38:53,865 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6cc1b7fa2/ecc750a35d0840c09d6ad0a38b63018c/FLAGc08b9bce6 [2018-10-25 01:38:53,882 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6cc1b7fa2/ecc750a35d0840c09d6ad0a38b63018c [2018-10-25 01:38:53,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:38:53,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:38:53,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:38:53,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:38:53,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:38:53,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:38:53" (1/1) ... [2018-10-25 01:38:53,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b326c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:53, skipping insertion in model container [2018-10-25 01:38:53,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:38:53" (1/1) ... [2018-10-25 01:38:53,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:38:54,079 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:38:55,363 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:38:55,368 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:38:56,017 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:38:56,055 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:38:56,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56 WrapperNode [2018-10-25 01:38:56,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:38:56,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:38:56,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:38:56,058 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:38:56,067 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:38:56" (1/1) ... [2018-10-25 01:38:56,136 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:38:56" (1/1) ... [2018-10-25 01:38:56,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:38:56,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:38:56,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:38:56,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:38:56,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (1/1) ... [2018-10-25 01:38:56,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (1/1) ... [2018-10-25 01:38:56,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (1/1) ... [2018-10-25 01:38:56,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (1/1) ... [2018-10-25 01:38:56,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (1/1) ... [2018-10-25 01:38:56,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (1/1) ... [2018-10-25 01:38:56,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (1/1) ... [2018-10-25 01:38:56,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:38:56,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:38:56,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:38:56,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:38:56,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (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:38:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:38:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:38:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:38:56,966 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:38:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:38:56,966 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:38:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:38:56,967 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:38:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:38:56,967 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:38:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:38:56,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:38:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:38:56,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:39:09,307 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:39:09,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:39:09 BoogieIcfgContainer [2018-10-25 01:39:09,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:39:09,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:39:09,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:39:09,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:39:09,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:38:53" (1/3) ... [2018-10-25 01:39:09,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b73a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:39:09, skipping insertion in model container [2018-10-25 01:39:09,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:56" (2/3) ... [2018-10-25 01:39:09,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b73a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:39:09, skipping insertion in model container [2018-10-25 01:39:09,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:39:09" (3/3) ... [2018-10-25 01:39:09,316 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label36_true-unreach-call.c [2018-10-25 01:39:09,326 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:39:09,335 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:39:09,352 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:39:09,397 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:39:09,398 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:39:09,398 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:39:09,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:39:09,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:39:09,398 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:39:09,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:39:09,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:39:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:39:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-25 01:39:09,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:09,447 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:39:09,450 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:09,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -21070164, now seen corresponding path program 1 times [2018-10-25 01:39:09,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:09,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:09,926 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:39:10,053 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:39:10,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:10,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:39:10,056 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:10,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:39:10,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:39:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:39:10,082 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:39:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:18,681 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:39:18,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:39:18,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-10-25 01:39:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:18,723 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:39:18,723 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:39:18,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:39:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:39:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:39:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:39:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2861 transitions. [2018-10-25 01:39:18,886 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2861 transitions. Word has length 64 [2018-10-25 01:39:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:18,887 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2861 transitions. [2018-10-25 01:39:18,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:39:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2861 transitions. [2018-10-25 01:39:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 01:39:18,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:18,897 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] [2018-10-25 01:39:18,897 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:18,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:18,898 INFO L82 PathProgramCache]: Analyzing trace with hash -131464626, now seen corresponding path program 1 times [2018-10-25 01:39:18,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:18,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:18,900 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 50 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:39:19,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:39:19,312 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:39:19,313 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-10-25 01:39:19,315 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], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2279], [2281], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:39:19,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:39:19,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:39:20,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:39:20,087 INFO L272 AbstractInterpreter]: Visited 84 different actions 160 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:39:20,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:20,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:39:20,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:39:20,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:39:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:20,152 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:39:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:20,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:39:20,611 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:39:20,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:39:21,005 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:39:21,037 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:39:21,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-10-25 01:39:21,037 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:21,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:39:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:39:21,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:39:21,039 INFO L87 Difference]: Start difference. First operand 1604 states and 2861 transitions. Second operand 3 states. [2018-10-25 01:39:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:29,929 INFO L93 Difference]: Finished difference Result 4738 states and 8562 transitions. [2018-10-25 01:39:29,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:39:29,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-10-25 01:39:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:29,960 INFO L225 Difference]: With dead ends: 4738 [2018-10-25 01:39:29,960 INFO L226 Difference]: Without dead ends: 3140 [2018-10-25 01:39:29,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:39:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2018-10-25 01:39:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3140. [2018-10-25 01:39:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-10-25 01:39:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 5269 transitions. [2018-10-25 01:39:30,076 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 5269 transitions. Word has length 140 [2018-10-25 01:39:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:30,077 INFO L481 AbstractCegarLoop]: Abstraction has 3140 states and 5269 transitions. [2018-10-25 01:39:30,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:39:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 5269 transitions. [2018-10-25 01:39:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 01:39:30,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:30,089 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] [2018-10-25 01:39:30,089 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:30,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:30,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1817766790, now seen corresponding path program 1 times [2018-10-25 01:39:30,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:30,093 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:30,309 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:39:30,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:30,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:39:30,310 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:30,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:39:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:39:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:39:30,312 INFO L87 Difference]: Start difference. First operand 3140 states and 5269 transitions. Second operand 5 states. [2018-10-25 01:39:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:40,967 INFO L93 Difference]: Finished difference Result 9545 states and 16221 transitions. [2018-10-25 01:39:40,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:39:40,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-10-25 01:39:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:41,010 INFO L225 Difference]: With dead ends: 9545 [2018-10-25 01:39:41,011 INFO L226 Difference]: Without dead ends: 6411 [2018-10-25 01:39:41,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2018-10-25 01:39:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 6350. [2018-10-25 01:39:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2018-10-25 01:39:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 9814 transitions. [2018-10-25 01:39:41,210 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 9814 transitions. Word has length 144 [2018-10-25 01:39:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:41,211 INFO L481 AbstractCegarLoop]: Abstraction has 6350 states and 9814 transitions. [2018-10-25 01:39:41,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:39:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 9814 transitions. [2018-10-25 01:39:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-25 01:39:41,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:41,216 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] [2018-10-25 01:39:41,216 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:41,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:41,216 INFO L82 PathProgramCache]: Analyzing trace with hash 841617251, now seen corresponding path program 1 times [2018-10-25 01:39:41,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:41,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:41,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:41,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:41,489 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:39:41,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:41,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:39:41,490 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:41,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:39:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:39:41,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:41,491 INFO L87 Difference]: Start difference. First operand 6350 states and 9814 transitions. Second operand 6 states. [2018-10-25 01:39:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:59,131 INFO L93 Difference]: Finished difference Result 25493 states and 42064 transitions. [2018-10-25 01:39:59,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:39:59,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-10-25 01:39:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:59,266 INFO L225 Difference]: With dead ends: 25493 [2018-10-25 01:39:59,266 INFO L226 Difference]: Without dead ends: 19149 [2018-10-25 01:39:59,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:39:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2018-10-25 01:39:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 19105. [2018-10-25 01:39:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19105 states. [2018-10-25 01:40:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19105 states to 19105 states and 28720 transitions. [2018-10-25 01:40:00,056 INFO L78 Accepts]: Start accepts. Automaton has 19105 states and 28720 transitions. Word has length 155 [2018-10-25 01:40:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:00,057 INFO L481 AbstractCegarLoop]: Abstraction has 19105 states and 28720 transitions. [2018-10-25 01:40:00,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:40:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19105 states and 28720 transitions. [2018-10-25 01:40:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-25 01:40:00,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:00,063 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] [2018-10-25 01:40:00,064 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:00,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash -483818014, now seen corresponding path program 1 times [2018-10-25 01:40:00,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:00,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:00,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:00,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:00,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:00,338 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:00,728 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:40:00,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:00,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:00,728 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:00,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:00,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:00,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:00,730 INFO L87 Difference]: Start difference. First operand 19105 states and 28720 transitions. Second operand 6 states. [2018-10-25 01:40:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:09,479 INFO L93 Difference]: Finished difference Result 52959 states and 84217 transitions. [2018-10-25 01:40:09,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:40:09,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-10-25 01:40:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:09,627 INFO L225 Difference]: With dead ends: 52959 [2018-10-25 01:40:09,627 INFO L226 Difference]: Without dead ends: 33860 [2018-10-25 01:40:09,681 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:40:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33860 states. [2018-10-25 01:40:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33860 to 33684. [2018-10-25 01:40:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33684 states. [2018-10-25 01:40:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33684 states to 33684 states and 50447 transitions. [2018-10-25 01:40:10,686 INFO L78 Accepts]: Start accepts. Automaton has 33684 states and 50447 transitions. Word has length 178 [2018-10-25 01:40:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:10,687 INFO L481 AbstractCegarLoop]: Abstraction has 33684 states and 50447 transitions. [2018-10-25 01:40:10,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:40:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 33684 states and 50447 transitions. [2018-10-25 01:40:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-25 01:40:10,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:10,693 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] [2018-10-25 01:40:10,693 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:10,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash 141226831, now seen corresponding path program 1 times [2018-10-25 01:40:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:10,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:10,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:10,935 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:40:10,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:10,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:40:10,936 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:10,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:40:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:40:10,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:40:10,937 INFO L87 Difference]: Start difference. First operand 33684 states and 50447 transitions. Second operand 4 states. [2018-10-25 01:40:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:20,864 INFO L93 Difference]: Finished difference Result 86005 states and 132641 transitions. [2018-10-25 01:40:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:40:20,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-10-25 01:40:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:21,089 INFO L225 Difference]: With dead ends: 86005 [2018-10-25 01:40:21,089 INFO L226 Difference]: Without dead ends: 52327 [2018-10-25 01:40:21,215 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:40:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52327 states. [2018-10-25 01:40:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52327 to 52317. [2018-10-25 01:40:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52317 states. [2018-10-25 01:40:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52317 states to 52317 states and 71502 transitions. [2018-10-25 01:40:22,213 INFO L78 Accepts]: Start accepts. Automaton has 52317 states and 71502 transitions. Word has length 213 [2018-10-25 01:40:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:22,213 INFO L481 AbstractCegarLoop]: Abstraction has 52317 states and 71502 transitions. [2018-10-25 01:40:22,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:40:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 52317 states and 71502 transitions. [2018-10-25 01:40:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-25 01:40:22,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:22,248 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, 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] [2018-10-25 01:40:22,248 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:22,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:22,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1519873088, now seen corresponding path program 1 times [2018-10-25 01:40:22,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:22,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:22,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:22,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:22,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:22,558 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 114 proven. 106 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:40:23,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:40:23,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:40:23,061 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 329 with the following transitions: [2018-10-25 01:40:23,063 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], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2279], [2281], [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], [2524], [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], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2692], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:40:23,075 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:40:23,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:40:23,342 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:40:23,342 INFO L272 AbstractInterpreter]: Visited 158 different actions 158 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:40:23,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:23,379 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:40:24,068 INFO L232 lantSequenceWeakener]: Weakened 319 states. On average, predicates are now at 75.58% of their original sizes. [2018-10-25 01:40:24,068 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:40:24,732 INFO L413 sIntCurrentIteration]: We have 327 unified AI predicates [2018-10-25 01:40:24,732 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:40:24,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:40:24,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:40:24,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:24,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:24,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:24,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:24,734 INFO L87 Difference]: Start difference. First operand 52317 states and 71502 transitions. Second operand 6 states. [2018-10-25 01:41:04,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:41:04,457 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:41:04,462 INFO L168 Benchmark]: Toolchain (without parser) took 130567.44 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-25 01:41:04,464 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:41:04,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2159.89 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: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:04,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 473.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:04,466 INFO L168 Benchmark]: Boogie Preprocessor took 358.45 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: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:04,467 INFO L168 Benchmark]: RCFGBuilder took 12418.44 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 169.9 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -176.2 MB). Peak memory consumption was 656.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:04,468 INFO L168 Benchmark]: TraceAbstraction took 115151.82 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.5 GB). Free memory was 2.4 GB in the beginning and 2.9 GB in the end (delta: -499.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-25 01:41:04,473 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 2159.89 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: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 473.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 358.45 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: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12418.44 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 169.9 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -176.2 MB). Peak memory consumption was 656.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115151.82 ms. Allocated memory was 2.5 GB in the beginning and 4.0 GB in the end (delta: 1.5 GB). Free memory was 2.4 GB in the beginning and 2.9 GB in the end (delta: -499.8 MB). Peak memory consumption was 1.0 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...