java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label00_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:30:33,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:30:33,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:30:33,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:30:33,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:30:33,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:30:33,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:30:33,674 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:30:33,676 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:30:33,677 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:30:33,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:30:33,678 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:30:33,679 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:30:33,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:30:33,681 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:30:33,682 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:30:33,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:30:33,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:30:33,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:30:33,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:30:33,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:30:33,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:30:33,693 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:30:33,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:30:33,694 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:30:33,695 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:30:33,696 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:30:33,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:30:33,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:30:33,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:30:33,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:30:33,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:30:33,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:30:33,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:30:33,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:30:33,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:30:33,708 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:30:33,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:30:33,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:30:33,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:30:33,743 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:30:33,743 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:30:33,744 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:30:33,744 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:30:33,744 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:30:33,744 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:30:33,745 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:30:33,745 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:30:33,745 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:30:33,745 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:30:33,745 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:30:33,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:30:33,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:30:33,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:30:33,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:30:33,748 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:30:33,748 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:30:33,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:30:33,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:30:33,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:30:33,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:30:33,749 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:30:33,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:30:33,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:30:33,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:30:33,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:30:33,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:30:33,750 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:30:33,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:30:33,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:30:33,751 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:30:33,751 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:30:33,751 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:30:33,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:30:33,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:30:33,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:30:33,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:30:33,822 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:30:33,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label00_false-unreach-call.c [2018-10-24 23:30:33,892 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/068cac0d2/06ed7b4477924b138b9245f7c1e794d7/FLAG6c94e48ba [2018-10-24 23:30:34,706 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:30:34,707 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label00_false-unreach-call.c [2018-10-24 23:30:34,740 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/068cac0d2/06ed7b4477924b138b9245f7c1e794d7/FLAG6c94e48ba [2018-10-24 23:30:34,760 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/068cac0d2/06ed7b4477924b138b9245f7c1e794d7 [2018-10-24 23:30:34,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:30:34,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:30:34,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:30:34,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:30:34,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:30:34,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:30:34" (1/1) ... [2018-10-24 23:30:34,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31cb433d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:34, skipping insertion in model container [2018-10-24 23:30:34,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:30:34" (1/1) ... [2018-10-24 23:30:34,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:30:34,985 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:30:36,424 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:30:36,429 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:30:37,029 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:30:37,068 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:30:37,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37 WrapperNode [2018-10-24 23:30:37,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:30:37,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:30:37,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:30:37,071 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:30:37,083 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:30:37" (1/1) ... [2018-10-24 23:30:37,166 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:30:37" (1/1) ... [2018-10-24 23:30:37,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:30:37,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:30:37,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:30:37,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:30:37,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37" (1/1) ... [2018-10-24 23:30:37,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37" (1/1) ... [2018-10-24 23:30:37,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37" (1/1) ... [2018-10-24 23:30:37,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37" (1/1) ... [2018-10-24 23:30:37,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37" (1/1) ... [2018-10-24 23:30:37,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37" (1/1) ... [2018-10-24 23:30:37,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37" (1/1) ... [2018-10-24 23:30:37,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:30:37,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:30:37,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:30:37,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:30:37,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30: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:30:38,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:30:38,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:30:38,057 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:30:38,057 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:30:38,058 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:30:38,058 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:30:38,059 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:30:38,059 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:30:38,059 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:30:38,059 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:30:38,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:30:38,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:30:38,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:30:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:30:48,830 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:30:48,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:30:48 BoogieIcfgContainer [2018-10-24 23:30:48,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:30:48,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:30:48,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:30:48,836 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:30:48,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:30:34" (1/3) ... [2018-10-24 23:30:48,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c53975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:30:48, skipping insertion in model container [2018-10-24 23:30:48,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:30:37" (2/3) ... [2018-10-24 23:30:48,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c53975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:30:48, skipping insertion in model container [2018-10-24 23:30:48,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:30:48" (3/3) ... [2018-10-24 23:30:48,839 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label00_false-unreach-call.c [2018-10-24 23:30:48,849 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:30:48,859 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:30:48,878 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:30:48,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:30:48,925 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:30:48,925 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:30:48,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:30:48,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:30:48,926 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:30:48,926 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:30:48,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:30:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-24 23:30:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 23:30:48,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:30:48,988 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:30:48,991 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:30:48,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:30:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1894883748, now seen corresponding path program 1 times [2018-10-24 23:30:48,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:30:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:30:49,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:30:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:30:49,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:30:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:30:49,470 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:30:49,610 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:30:49,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:30:49,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:30:49,613 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:30:49,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:30:49,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:30:49,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:30:49,633 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-24 23:30:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:30:58,685 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-24 23:30:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:30:58,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-24 23:30:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:30:58,720 INFO L225 Difference]: With dead ends: 2446 [2018-10-24 23:30:58,720 INFO L226 Difference]: Without dead ends: 1604 [2018-10-24 23:30:58,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:30:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-24 23:30:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-24 23:30:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-24 23:30:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2969 transitions. [2018-10-24 23:30:58,882 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2969 transitions. Word has length 22 [2018-10-24 23:30:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:30:58,883 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2969 transitions. [2018-10-24 23:30:58,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:30:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2969 transitions. [2018-10-24 23:30:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-24 23:30:58,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:30:58,889 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] [2018-10-24 23:30:58,889 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:30:58,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:30:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash -852828470, now seen corresponding path program 1 times [2018-10-24 23:30:58,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:30:58,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:30:58,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:30:58,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:30:58,891 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:30:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:30:59,273 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:30:59,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:30:59,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:30:59,274 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:30:59,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:30:59,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:30:59,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:30:59,277 INFO L87 Difference]: Start difference. First operand 1604 states and 2969 transitions. Second operand 5 states. [2018-10-24 23:31:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:31:12,971 INFO L93 Difference]: Finished difference Result 4038 states and 7427 transitions. [2018-10-24 23:31:12,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:31:12,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-10-24 23:31:12,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:31:12,988 INFO L225 Difference]: With dead ends: 4038 [2018-10-24 23:31:12,989 INFO L226 Difference]: Without dead ends: 2440 [2018-10-24 23:31:12,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:31:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2018-10-24 23:31:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2413. [2018-10-24 23:31:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2018-10-24 23:31:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 4141 transitions. [2018-10-24 23:31:13,083 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 4141 transitions. Word has length 96 [2018-10-24 23:31:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:31:13,083 INFO L481 AbstractCegarLoop]: Abstraction has 2413 states and 4141 transitions. [2018-10-24 23:31:13,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:31:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 4141 transitions. [2018-10-24 23:31:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 23:31:13,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:31:13,088 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] [2018-10-24 23:31:13,089 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:31:13,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:31:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash 113742438, now seen corresponding path program 1 times [2018-10-24 23:31:13,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:31:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:13,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:31:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:13,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:31:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:31:13,260 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:31:13,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:31:13,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:31:13,260 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:31:13,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:31:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:31:13,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:31:13,264 INFO L87 Difference]: Start difference. First operand 2413 states and 4141 transitions. Second operand 4 states. [2018-10-24 23:31:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:31:22,911 INFO L93 Difference]: Finished difference Result 9492 states and 16758 transitions. [2018-10-24 23:31:22,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:31:22,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-10-24 23:31:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:31:22,966 INFO L225 Difference]: With dead ends: 9492 [2018-10-24 23:31:22,966 INFO L226 Difference]: Without dead ends: 7085 [2018-10-24 23:31:22,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:31:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2018-10-24 23:31:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 7085. [2018-10-24 23:31:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2018-10-24 23:31:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 11755 transitions. [2018-10-24 23:31:23,210 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 11755 transitions. Word has length 98 [2018-10-24 23:31:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:31:23,211 INFO L481 AbstractCegarLoop]: Abstraction has 7085 states and 11755 transitions. [2018-10-24 23:31:23,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:31:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 11755 transitions. [2018-10-24 23:31:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-24 23:31:23,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:31:23,221 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] [2018-10-24 23:31:23,221 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:31:23,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:31:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash -180266589, now seen corresponding path program 1 times [2018-10-24 23:31:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:31:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:31:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:23,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:31:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:31:23,554 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:31:23,840 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:31:23,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:31:23,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:31:23,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:31:23,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:31:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:31:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:31:23,842 INFO L87 Difference]: Start difference. First operand 7085 states and 11755 transitions. Second operand 6 states. [2018-10-24 23:31:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:31:34,803 INFO L93 Difference]: Finished difference Result 25970 states and 44847 transitions. [2018-10-24 23:31:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:31:34,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-24 23:31:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:31:34,911 INFO L225 Difference]: With dead ends: 25970 [2018-10-24 23:31:34,911 INFO L226 Difference]: Without dead ends: 18891 [2018-10-24 23:31:34,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:31:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18891 states. [2018-10-24 23:31:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18891 to 18789. [2018-10-24 23:31:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18789 states. [2018-10-24 23:31:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18789 states to 18789 states and 28878 transitions. [2018-10-24 23:31:35,695 INFO L78 Accepts]: Start accepts. Automaton has 18789 states and 28878 transitions. Word has length 125 [2018-10-24 23:31:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:31:35,696 INFO L481 AbstractCegarLoop]: Abstraction has 18789 states and 28878 transitions. [2018-10-24 23:31:35,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:31:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 18789 states and 28878 transitions. [2018-10-24 23:31:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-24 23:31:35,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:31:35,723 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, 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] [2018-10-24 23:31:35,723 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:31:35,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:31:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash -284671976, now seen corresponding path program 1 times [2018-10-24 23:31:35,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:31:35,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:35,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:31:35,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:35,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:31:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:31:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 33 proven. 67 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 23:31:36,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:31:36,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:31:36,520 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-10-24 23:31:36,523 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1943], [1945], [1948], [1956], [1964], [1972], [1980], [1988], [1996], [2004], [2012], [2020], [2028], [2036], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2672], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-24 23:31:36,577 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:31:36,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:31:37,510 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:31:37,511 INFO L272 AbstractInterpreter]: Visited 157 different actions 306 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-24 23:31:37,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:31:37,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:31:37,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:31:37,557 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 23:31:37,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:31:37,571 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:31:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:31:37,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:31:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-24 23:31:38,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:31:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-24 23:31:39,451 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:31:39,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 12 [2018-10-24 23:31:39,452 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:31:39,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:31:39,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:31:39,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-24 23:31:39,454 INFO L87 Difference]: Start difference. First operand 18789 states and 28878 transitions. Second operand 5 states. [2018-10-24 23:31:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:31:55,246 INFO L93 Difference]: Finished difference Result 63782 states and 102144 transitions. [2018-10-24 23:31:55,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:31:55,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2018-10-24 23:31:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:31:55,462 INFO L225 Difference]: With dead ends: 63782 [2018-10-24 23:31:55,462 INFO L226 Difference]: Without dead ends: 44999 [2018-10-24 23:31:55,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 488 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-24 23:31:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44999 states. [2018-10-24 23:31:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44999 to 44818. [2018-10-24 23:31:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44818 states. [2018-10-24 23:31:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44818 states to 44818 states and 62944 transitions. [2018-10-24 23:31:56,998 INFO L78 Accepts]: Start accepts. Automaton has 44818 states and 62944 transitions. Word has length 246 [2018-10-24 23:31:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:31:56,999 INFO L481 AbstractCegarLoop]: Abstraction has 44818 states and 62944 transitions. [2018-10-24 23:31:56,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:31:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 44818 states and 62944 transitions. [2018-10-24 23:31:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-24 23:31:57,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:31:57,033 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:31:57,034 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:31:57,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:31:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash 669260836, now seen corresponding path program 1 times [2018-10-24 23:31:57,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:31:57,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:57,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:31:57,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:57,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:31:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:31:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:31:58,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:31:58,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:31:58,003 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-10-24 23:31:58,003 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1943], [1945], [1948], [1956], [1964], [1972], [1980], [1988], [1996], [2004], [2012], [2020], [2028], [2036], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2424], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2672], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-24 23:31:58,019 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:31:58,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:31:58,276 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:31:58,276 INFO L272 AbstractInterpreter]: Visited 153 different actions 153 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:31:58,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:31:58,324 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:31:58,893 INFO L232 lantSequenceWeakener]: Weakened 247 states. On average, predicates are now at 75.04% of their original sizes. [2018-10-24 23:31:58,893 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:31:59,143 INFO L413 sIntCurrentIteration]: We have 255 unified AI predicates [2018-10-24 23:31:59,146 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:31:59,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:31:59,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-24 23:31:59,148 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:31:59,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:31:59,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:31:59,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:31:59,149 INFO L87 Difference]: Start difference. First operand 44818 states and 62944 transitions. Second operand 6 states. [2018-10-24 23:32:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:32:01,815 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.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.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:32:01,830 INFO L168 Benchmark]: Toolchain (without parser) took 87057.49 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -931.2 MB). Peak memory consumption was 612.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:32:01,832 INFO L168 Benchmark]: CDTParser took 0.30 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:32:01,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2292.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:32:01,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 577.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 807.9 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:32:01,834 INFO L168 Benchmark]: Boogie Preprocessor took 327.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:32:01,842 INFO L168 Benchmark]: RCFGBuilder took 10855.21 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 185.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -200.0 MB). Peak memory consumption was 679.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:32:01,843 INFO L168 Benchmark]: TraceAbstraction took 72994.58 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 551.0 MB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 77.3 MB). Peak memory consumption was 628.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:32:01,854 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.30 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 2292.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 577.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 807.9 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 327.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10855.21 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 185.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -200.0 MB). Peak memory consumption was 679.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72994.58 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 551.0 MB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 77.3 MB). Peak memory consumption was 628.3 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...