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/Problem16_label35_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:53:22,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:53:22,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:53:22,884 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:53:22,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:53:22,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:53:22,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:53:22,891 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:53:22,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:53:22,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:53:22,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:53:22,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:53:22,904 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:53:22,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:53:22,909 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:53:22,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:53:22,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:53:22,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:53:22,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:53:22,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:53:22,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:53:22,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:53:22,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:53:22,928 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:53:22,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:53:22,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:53:22,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:53:22,930 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:53:22,931 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:53:22,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:53:22,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:53:22,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:53:22,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:53:22,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:53:22,934 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:53:22,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:53:22,935 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:53:22,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:53:22,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:53:22,963 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:53:22,963 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:53:22,963 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:53:22,964 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:53:22,964 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:53:22,964 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:53:22,964 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:53:22,964 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:53:22,964 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:53:22,965 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:53:22,965 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:53:22,965 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:53:22,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:53:22,967 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:53:22,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:53:22,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:53:22,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:53:22,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:53:22,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:53:22,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:53:22,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:53:22,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:53:22,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:53:22,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:53:22,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:53:22,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:53:22,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:53:22,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:53:22,971 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:53:22,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:53:22,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:53:22,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:53:22,972 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:53:22,972 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:53:23,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:53:23,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:53:23,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:53:23,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:53:23,047 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:53:23,048 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label35_true-unreach-call.c [2018-10-25 01:53:23,102 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/106561a45/fc6b44a6d5fc424f9110e3fbde8d2ce3/FLAG6dbd0d687 [2018-10-25 01:53:23,876 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:53:23,877 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label35_true-unreach-call.c [2018-10-25 01:53:23,900 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/106561a45/fc6b44a6d5fc424f9110e3fbde8d2ce3/FLAG6dbd0d687 [2018-10-25 01:53:23,924 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/106561a45/fc6b44a6d5fc424f9110e3fbde8d2ce3 [2018-10-25 01:53:23,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:53:23,940 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:53:23,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:53:23,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:53:23,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:53:23,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:53:23" (1/1) ... [2018-10-25 01:53:23,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d78c705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:23, skipping insertion in model container [2018-10-25 01:53:23,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:53:23" (1/1) ... [2018-10-25 01:53:23,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:53:24,064 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:53:24,858 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:53:24,863 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:53:25,109 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:53:25,132 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:53:25,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25 WrapperNode [2018-10-25 01:53:25,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:53:25,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:53:25,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:53:25,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:53:25,145 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:53:25" (1/1) ... [2018-10-25 01:53:25,195 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:53:25" (1/1) ... [2018-10-25 01:53:25,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:53:25,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:53:25,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:53:25,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:53:25,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (1/1) ... [2018-10-25 01:53:25,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (1/1) ... [2018-10-25 01:53:25,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (1/1) ... [2018-10-25 01:53:25,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (1/1) ... [2018-10-25 01:53:25,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (1/1) ... [2018-10-25 01:53:25,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (1/1) ... [2018-10-25 01:53:25,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (1/1) ... [2018-10-25 01:53:25,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:53:25,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:53:25,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:53:25,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:53:25,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (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:53:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:53:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:53:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:53:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:53:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:53:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:53:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:53:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:53:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:53:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:53:32,802 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:53:32,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:53:32 BoogieIcfgContainer [2018-10-25 01:53:32,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:53:32,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:53:32,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:53:32,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:53:32,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:53:23" (1/3) ... [2018-10-25 01:53:32,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db26489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:53:32, skipping insertion in model container [2018-10-25 01:53:32,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:25" (2/3) ... [2018-10-25 01:53:32,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db26489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:53:32, skipping insertion in model container [2018-10-25 01:53:32,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:53:32" (3/3) ... [2018-10-25 01:53:32,813 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label35_true-unreach-call.c [2018-10-25 01:53:32,823 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:53:32,835 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:53:32,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:53:32,914 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:53:32,915 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:53:32,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:53:32,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:53:32,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:53:32,916 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:53:32,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:53:32,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:53:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:53:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-25 01:53:32,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:32,981 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] [2018-10-25 01:53:32,985 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:32,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1960867948, now seen corresponding path program 1 times [2018-10-25 01:53:32,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:33,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:33,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:33,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:33,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:33,516 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:53:33,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:33,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:53:33,519 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:33,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:53:33,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:53:33,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:53:33,550 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-25 01:53:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:39,696 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-25 01:53:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:53:39,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-10-25 01:53:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:39,729 INFO L225 Difference]: With dead ends: 1513 [2018-10-25 01:53:39,729 INFO L226 Difference]: Without dead ends: 1097 [2018-10-25 01:53:39,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:53:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-25 01:53:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-10-25 01:53:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:53:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1357 transitions. [2018-10-25 01:53:39,854 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1357 transitions. Word has length 48 [2018-10-25 01:53:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:39,855 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1357 transitions. [2018-10-25 01:53:39,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:53:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1357 transitions. [2018-10-25 01:53:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-25 01:53:39,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:39,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:39,864 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:39,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 321031098, now seen corresponding path program 1 times [2018-10-25 01:53:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:39,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:39,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:39,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:39,867 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:40,226 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:53:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:40,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:40,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:53:40,314 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:40,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:53:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:53:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:53:40,317 INFO L87 Difference]: Start difference. First operand 744 states and 1357 transitions. Second operand 5 states. [2018-10-25 01:53:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:45,310 INFO L93 Difference]: Finished difference Result 2196 states and 4092 transitions. [2018-10-25 01:53:45,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:45,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-10-25 01:53:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:45,339 INFO L225 Difference]: With dead ends: 2196 [2018-10-25 01:53:45,339 INFO L226 Difference]: Without dead ends: 1458 [2018-10-25 01:53:45,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:53:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-25 01:53:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-10-25 01:53:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-25 01:53:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2551 transitions. [2018-10-25 01:53:45,438 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2551 transitions. Word has length 118 [2018-10-25 01:53:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:45,438 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 2551 transitions. [2018-10-25 01:53:45,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:53:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2551 transitions. [2018-10-25 01:53:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 01:53:45,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:45,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:45,451 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:45,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:45,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1441710001, now seen corresponding path program 1 times [2018-10-25 01:53:45,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:45,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:45,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:45,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:45,697 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:53:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:45,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:45,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:45,785 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:45,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:45,786 INFO L87 Difference]: Start difference. First operand 1438 states and 2551 transitions. Second operand 6 states. [2018-10-25 01:53:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:50,527 INFO L93 Difference]: Finished difference Result 4237 states and 7540 transitions. [2018-10-25 01:53:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:50,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-25 01:53:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:50,547 INFO L225 Difference]: With dead ends: 4237 [2018-10-25 01:53:50,547 INFO L226 Difference]: Without dead ends: 2805 [2018-10-25 01:53:50,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:53:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2018-10-25 01:53:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2785. [2018-10-25 01:53:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2018-10-25 01:53:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4352 transitions. [2018-10-25 01:53:50,642 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4352 transitions. Word has length 121 [2018-10-25 01:53:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:50,643 INFO L481 AbstractCegarLoop]: Abstraction has 2785 states and 4352 transitions. [2018-10-25 01:53:50,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4352 transitions. [2018-10-25 01:53:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-25 01:53:50,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:50,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:50,648 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:50,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash 692588274, now seen corresponding path program 1 times [2018-10-25 01:53:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:50,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:50,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:50,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:50,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:50,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:50,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:50,915 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:50,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:50,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:50,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:50,916 INFO L87 Difference]: Start difference. First operand 2785 states and 4352 transitions. Second operand 6 states. [2018-10-25 01:53:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:55,153 INFO L93 Difference]: Finished difference Result 6952 states and 11048 transitions. [2018-10-25 01:53:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:53:55,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-10-25 01:53:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:55,178 INFO L225 Difference]: With dead ends: 6952 [2018-10-25 01:53:55,178 INFO L226 Difference]: Without dead ends: 4173 [2018-10-25 01:53:55,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:53:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2018-10-25 01:53:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4153. [2018-10-25 01:53:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2018-10-25 01:53:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 5896 transitions. [2018-10-25 01:53:55,321 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 5896 transitions. Word has length 122 [2018-10-25 01:53:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:55,322 INFO L481 AbstractCegarLoop]: Abstraction has 4153 states and 5896 transitions. [2018-10-25 01:53:55,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:53:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 5896 transitions. [2018-10-25 01:53:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-25 01:53:55,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:55,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:55,326 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:55,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1832365575, now seen corresponding path program 1 times [2018-10-25 01:53:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:55,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:55,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:55,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:53:55,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:53:55,479 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:55,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:55,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:55,480 INFO L87 Difference]: Start difference. First operand 4153 states and 5896 transitions. Second operand 6 states. [2018-10-25 01:54:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:00,961 INFO L93 Difference]: Finished difference Result 11374 states and 16767 transitions. [2018-10-25 01:54:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:00,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-25 01:54:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:01,006 INFO L225 Difference]: With dead ends: 11374 [2018-10-25 01:54:01,006 INFO L226 Difference]: Without dead ends: 7227 [2018-10-25 01:54:01,034 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:54:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2018-10-25 01:54:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7152. [2018-10-25 01:54:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7152 states. [2018-10-25 01:54:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 9826 transitions. [2018-10-25 01:54:01,243 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 9826 transitions. Word has length 125 [2018-10-25 01:54:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:01,244 INFO L481 AbstractCegarLoop]: Abstraction has 7152 states and 9826 transitions. [2018-10-25 01:54:01,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 9826 transitions. [2018-10-25 01:54:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-25 01:54:01,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:01,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:01,249 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:01,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash 911780215, now seen corresponding path program 1 times [2018-10-25 01:54:01,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:01,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:01,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:01,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:01,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:01,496 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:54:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:01,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:01,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:01,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:01,667 INFO L87 Difference]: Start difference. First operand 7152 states and 9826 transitions. Second operand 6 states. [2018-10-25 01:54:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:07,728 INFO L93 Difference]: Finished difference Result 17771 states and 25546 transitions. [2018-10-25 01:54:07,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:07,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-10-25 01:54:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:07,796 INFO L225 Difference]: With dead ends: 17771 [2018-10-25 01:54:07,796 INFO L226 Difference]: Without dead ends: 10625 [2018-10-25 01:54:07,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:54:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10625 states. [2018-10-25 01:54:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10625 to 10585. [2018-10-25 01:54:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10585 states. [2018-10-25 01:54:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 13819 transitions. [2018-10-25 01:54:08,092 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 13819 transitions. Word has length 133 [2018-10-25 01:54:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:08,092 INFO L481 AbstractCegarLoop]: Abstraction has 10585 states and 13819 transitions. [2018-10-25 01:54:08,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 13819 transitions. [2018-10-25 01:54:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 01:54:08,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:08,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:08,095 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:08,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1008425326, now seen corresponding path program 1 times [2018-10-25 01:54:08,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:08,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:08,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 01:54:08,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:54:08,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:54:08,426 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-10-25 01:54:08,428 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:54:08,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:54:08,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:54:09,546 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:54:09,549 INFO L272 AbstractInterpreter]: Visited 99 different actions 284 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-25 01:54:09,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:09,594 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:54:10,430 INFO L232 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 81.65% of their original sizes. [2018-10-25 01:54:10,430 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:54:13,068 INFO L413 sIntCurrentIteration]: We have 139 unified AI predicates [2018-10-25 01:54:13,068 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:54:13,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:54:13,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-25 01:54:13,069 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:13,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 01:54:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 01:54:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-25 01:54:13,071 INFO L87 Difference]: Start difference. First operand 10585 states and 13819 transitions. Second operand 14 states. [2018-10-25 01:55:08,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-25 01:55:08,848 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:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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:55:08,853 INFO L168 Benchmark]: Toolchain (without parser) took 104915.42 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 871.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:08,855 INFO L168 Benchmark]: CDTParser took 0.19 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:55:08,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1192.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:08,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 336.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -827.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:08,857 INFO L168 Benchmark]: Boogie Preprocessor took 160.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:08,858 INFO L168 Benchmark]: RCFGBuilder took 7172.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 250.3 MB). Peak memory consumption was 250.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:08,859 INFO L168 Benchmark]: TraceAbstraction took 96047.26 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 620.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:08,865 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.19 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 1192.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 336.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -827.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 160.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7172.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 250.3 MB). Peak memory consumption was 250.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96047.26 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 620.4 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...