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_label30_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:43:35,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:43:35,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:43:35,813 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:43:35,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:43:35,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:43:35,816 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:43:35,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:43:35,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:43:35,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:43:35,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:43:35,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:43:35,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:43:35,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:43:35,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:43:35,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:43:35,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:43:35,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:43:35,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:43:35,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:43:35,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:43:35,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:43:35,855 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:43:35,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:43:35,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:43:35,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:43:35,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:43:35,859 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:43:35,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:43:35,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:43:35,861 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:43:35,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:43:35,862 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:43:35,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:43:35,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:43:35,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:43:35,866 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-24 23:43:35,892 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:43:35,893 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:43:35,894 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:43:35,894 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:43:35,894 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:43:35,895 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:43:35,895 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:43:35,895 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:43:35,895 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:43:35,895 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:43:35,895 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:43:35,896 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:43:35,896 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:43:35,897 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:43:35,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:43:35,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:43:35,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:43:35,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:43:35,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:43:35,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:43:35,899 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:43:35,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:43:35,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:43:35,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:43:35,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:43:35,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:43:35,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:43:35,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:43:35,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:43:35,902 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:43:35,902 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:43:35,902 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:43:35,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:43:35,903 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:43:35,903 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:43:35,903 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:43:35,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:43:35,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:43:35,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:43:35,981 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:43:35,981 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:43:35,982 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label30_false-unreach-call.c [2018-10-24 23:43:36,037 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c238b87a/72bb51b37c674c45b8f861ba259917a8/FLAG77ed4bdd4 [2018-10-24 23:43:36,698 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:43:36,699 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label30_false-unreach-call.c [2018-10-24 23:43:36,723 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c238b87a/72bb51b37c674c45b8f861ba259917a8/FLAG77ed4bdd4 [2018-10-24 23:43:36,745 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c238b87a/72bb51b37c674c45b8f861ba259917a8 [2018-10-24 23:43:36,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:43:36,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:43:36,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:43:36,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:43:36,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:43:36,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:43:36" (1/1) ... [2018-10-24 23:43:36,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b692d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:36, skipping insertion in model container [2018-10-24 23:43:36,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:43:36" (1/1) ... [2018-10-24 23:43:36,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:43:36,880 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:43:37,640 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:43:37,645 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:43:37,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:43:37,955 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:43:37,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37 WrapperNode [2018-10-24 23:43:37,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:43:37,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:43:37,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:43:37,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:43:37,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:43:38,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:43:38,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:43:38,277 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:43:38,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (1/1) ... [2018-10-24 23:43:38,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:43:38,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:43:38,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:43:38,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:43:38,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (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-24 23:43:38,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:43:38,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:43:38,521 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:43:38,521 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:43:38,522 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:43:38,522 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:43:38,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:43:38,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:43:38,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:43:38,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:43:44,700 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:43:44,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:44 BoogieIcfgContainer [2018-10-24 23:43:44,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:43:44,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:43:44,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:43:44,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:43:44,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:43:36" (1/3) ... [2018-10-24 23:43:44,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433d0341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:44, skipping insertion in model container [2018-10-24 23:43:44,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:37" (2/3) ... [2018-10-24 23:43:44,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433d0341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:44, skipping insertion in model container [2018-10-24 23:43:44,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:44" (3/3) ... [2018-10-24 23:43:44,710 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label30_false-unreach-call.c [2018-10-24 23:43:44,720 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:43:44,728 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:43:44,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:43:44,789 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:43:44,790 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:43:44,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:43:44,790 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:43:44,790 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:43:44,790 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:43:44,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:43:44,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:43:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-24 23:43:44,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 23:43:44,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:44,833 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] [2018-10-24 23:43:44,835 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:44,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash 328599972, now seen corresponding path program 1 times [2018-10-24 23:43:44,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:44,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:44,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:44,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:44,903 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:45,257 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-24 23:43:45,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:45,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:43:45,260 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:45,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:43:45,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:43:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:43:45,316 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-24 23:43:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:53,010 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-24 23:43:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:43:53,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-24 23:43:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:53,044 INFO L225 Difference]: With dead ends: 1513 [2018-10-24 23:43:53,045 INFO L226 Difference]: Without dead ends: 1097 [2018-10-24 23:43:53,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:43:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-24 23:43:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2018-10-24 23:43:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-10-24 23:43:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1954 transitions. [2018-10-24 23:43:53,185 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1954 transitions. Word has length 22 [2018-10-24 23:43:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:53,185 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1954 transitions. [2018-10-24 23:43:53,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:43:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1954 transitions. [2018-10-24 23:43:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-24 23:43:53,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:53,194 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:43:53,194 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:53,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1272949813, now seen corresponding path program 1 times [2018-10-24 23:43:53,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:53,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:53,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:53,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:53,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:53,490 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:53,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:53,493 INFO L87 Difference]: Start difference. First operand 1097 states and 1954 transitions. Second operand 6 states. [2018-10-24 23:43:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:58,408 INFO L93 Difference]: Finished difference Result 3259 states and 5952 transitions. [2018-10-24 23:43:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:43:58,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-10-24 23:43:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:58,437 INFO L225 Difference]: With dead ends: 3259 [2018-10-24 23:43:58,438 INFO L226 Difference]: Without dead ends: 2168 [2018-10-24 23:43:58,444 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-24 23:43:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-24 23:43:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2142. [2018-10-24 23:43:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-10-24 23:43:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3739 transitions. [2018-10-24 23:43:58,526 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3739 transitions. Word has length 93 [2018-10-24 23:43:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:58,526 INFO L481 AbstractCegarLoop]: Abstraction has 2142 states and 3739 transitions. [2018-10-24 23:43:58,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:43:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3739 transitions. [2018-10-24 23:43:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-24 23:43:58,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:58,532 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:43:58,532 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:58,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash 48893395, now seen corresponding path program 1 times [2018-10-24 23:43:58,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:58,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:58,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:58,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:58,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:58,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:58,802 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:58,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:58,803 INFO L87 Difference]: Start difference. First operand 2142 states and 3739 transitions. Second operand 6 states. [2018-10-24 23:44:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:44:04,145 INFO L93 Difference]: Finished difference Result 7053 states and 12688 transitions. [2018-10-24 23:44:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:44:04,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-24 23:44:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:44:04,183 INFO L225 Difference]: With dead ends: 7053 [2018-10-24 23:44:04,183 INFO L226 Difference]: Without dead ends: 4917 [2018-10-24 23:44:04,205 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-24 23:44:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2018-10-24 23:44:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4877. [2018-10-24 23:44:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2018-10-24 23:44:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 7891 transitions. [2018-10-24 23:44:04,365 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 7891 transitions. Word has length 121 [2018-10-24 23:44:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:44:04,366 INFO L481 AbstractCegarLoop]: Abstraction has 4877 states and 7891 transitions. [2018-10-24 23:44:04,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:44:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 7891 transitions. [2018-10-24 23:44:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-24 23:44:04,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:44:04,369 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:44:04,374 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:44:04,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:44:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1031937393, now seen corresponding path program 1 times [2018-10-24 23:44:04,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:44:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:04,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:44:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:04,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:44:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:44:04,633 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:44:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:44:04,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:44:04,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:44:04,710 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:44:04,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:44:04,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:44:04,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:44:04,712 INFO L87 Difference]: Start difference. First operand 4877 states and 7891 transitions. Second operand 6 states. [2018-10-24 23:44:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:44:07,574 INFO L93 Difference]: Finished difference Result 11909 states and 19972 transitions. [2018-10-24 23:44:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:44:07,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-10-24 23:44:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:44:07,622 INFO L225 Difference]: With dead ends: 11909 [2018-10-24 23:44:07,623 INFO L226 Difference]: Without dead ends: 7038 [2018-10-24 23:44:07,647 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-24 23:44:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2018-10-24 23:44:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 6977. [2018-10-24 23:44:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-10-24 23:44:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 9942 transitions. [2018-10-24 23:44:07,852 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 9942 transitions. Word has length 139 [2018-10-24 23:44:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:44:07,852 INFO L481 AbstractCegarLoop]: Abstraction has 6977 states and 9942 transitions. [2018-10-24 23:44:07,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:44:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 9942 transitions. [2018-10-24 23:44:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-24 23:44:07,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:44:07,856 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 23:44:07,856 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:44:07,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:44:07,856 INFO L82 PathProgramCache]: Analyzing trace with hash 203002038, now seen corresponding path program 1 times [2018-10-24 23:44:07,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:44:07,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:07,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:44:07,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:07,858 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:44:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:44:08,153 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:44:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:44:08,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:44:08,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:44:08,654 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:44:08,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:44:08,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:44:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:44:08,656 INFO L87 Difference]: Start difference. First operand 6977 states and 9942 transitions. Second operand 6 states. [2018-10-24 23:44:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:44:15,441 INFO L93 Difference]: Finished difference Result 17709 states and 25496 transitions. [2018-10-24 23:44:15,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:44:15,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2018-10-24 23:44:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:44:15,498 INFO L225 Difference]: With dead ends: 17709 [2018-10-24 23:44:15,499 INFO L226 Difference]: Without dead ends: 10738 [2018-10-24 23:44:15,541 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-24 23:44:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10738 states. [2018-10-24 23:44:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10738 to 10702. [2018-10-24 23:44:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2018-10-24 23:44:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 14504 transitions. [2018-10-24 23:44:15,823 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 14504 transitions. Word has length 186 [2018-10-24 23:44:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:44:15,824 INFO L481 AbstractCegarLoop]: Abstraction has 10702 states and 14504 transitions. [2018-10-24 23:44:15,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:44:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 14504 transitions. [2018-10-24 23:44:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 23:44:15,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:44:15,827 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 23:44:15,828 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:44:15,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:44:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash 773533269, now seen corresponding path program 1 times [2018-10-24 23:44:15,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:44:15,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:15,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:44:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:44:15,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:44:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:44:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:44:16,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:44:16,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:44:16,182 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-10-24 23:44:16,185 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [255], [257], [260], [268], [276], [284], [292], [300], [308], [316], [324], [332], [340], [348], [356], [364], [372], [380], [388], [396], [404], [412], [420], [428], [436], [444], [452], [460], [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], [676], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-24 23:44:16,246 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:44:16,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:44:16,876 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:44:16,878 INFO L272 AbstractInterpreter]: Visited 135 different actions 135 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:44:16,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:44:16,923 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:44:17,401 INFO L232 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 77.4% of their original sizes. [2018-10-24 23:44:17,401 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:44:17,667 INFO L413 sIntCurrentIteration]: We have 222 unified AI predicates [2018-10-24 23:44:17,667 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:44:17,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:44:17,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-24 23:44:17,668 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:44:17,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:44:17,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:44:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:44:17,673 INFO L87 Difference]: Start difference. First operand 10702 states and 14504 transitions. Second operand 6 states. [2018-10-24 23:44:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:44:42,425 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-24 23:44:42,430 INFO L168 Benchmark]: Toolchain (without parser) took 65671.22 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.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 889.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:42,431 INFO L168 Benchmark]: CDTParser took 0.18 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-24 23:44:42,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1195.47 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-24 23:44:42,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 319.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -855.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:42,433 INFO L168 Benchmark]: Boogie Preprocessor took 168.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:42,435 INFO L168 Benchmark]: RCFGBuilder took 6256.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 243.3 MB). Peak memory consumption was 243.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:42,435 INFO L168 Benchmark]: TraceAbstraction took 57726.67 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 660.5 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:42,441 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.18 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 1195.47 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 319.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -855.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6256.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 243.3 MB). Peak memory consumption was 243.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57726.67 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 660.5 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...