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/Problem13_label47_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:43:57,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:43:57,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:43:57,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:43:57,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:43:57,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:43:57,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:43:57,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:43:57,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:43:57,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:43:57,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:43:57,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:43:57,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:43:57,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:43:57,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:43:57,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:43:57,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:43:57,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:43:57,936 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:43:57,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:43:57,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:43:57,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:43:57,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:43:57,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:43:57,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:43:57,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:43:57,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:43:57,948 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:43:57,950 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:43:57,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:43:57,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:43:57,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:43:57,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:43:57,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:43:57,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:43:57,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:43:57,956 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 01:43:57,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:43:57,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:43:57,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:43:57,983 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:43:57,983 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:43:57,983 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:43:57,984 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:43:57,987 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:43:57,987 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:43:57,987 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:43:57,987 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:43:57,987 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:43:57,987 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:43:57,987 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:43:57,988 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:43:57,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:43:57,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:43:57,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:43:57,989 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:43:57,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:43:57,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:43:57,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:43:57,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:43:57,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:43:57,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:43:57,992 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:43:57,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:43:57,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:43:57,993 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:43:57,993 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:43:57,994 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:43:57,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:43:57,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:43:57,995 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:43:57,996 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:43:57,996 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:43:58,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:43:58,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:43:58,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:43:58,099 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:43:58,099 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:43:58,100 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label47_true-unreach-call.c [2018-10-25 01:43:58,155 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5dd315caf/5a78c4392f8347e291daa896509f0265/FLAG6b9d289f1 [2018-10-25 01:43:58,944 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:43:58,945 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label47_true-unreach-call.c [2018-10-25 01:43:58,986 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5dd315caf/5a78c4392f8347e291daa896509f0265/FLAG6b9d289f1 [2018-10-25 01:43:59,007 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5dd315caf/5a78c4392f8347e291daa896509f0265 [2018-10-25 01:43:59,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:43:59,022 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:43:59,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:43:59,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:43:59,029 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:43:59,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:43:59" (1/1) ... [2018-10-25 01:43:59,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d38c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:43:59, skipping insertion in model container [2018-10-25 01:43:59,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:43:59" (1/1) ... [2018-10-25 01:43:59,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:43:59,225 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:44:00,784 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:44:00,793 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:44:01,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:44:01,533 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:44:01,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01 WrapperNode [2018-10-25 01:44:01,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:44:01,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:44:01,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:44:01,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:44:01,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:01,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:44:02,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:44:02,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:44:02,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:44:02,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... [2018-10-25 01:44:02,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:44:02,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:44:02,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:44:02,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:44:02,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:44:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:44:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:44:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:44:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:44:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:44:02,459 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:44:02,459 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:44:02,459 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:44:02,459 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:44:02,460 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:44:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:44:02,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:44:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:44:02,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:44:13,216 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:44:13,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:44:13 BoogieIcfgContainer [2018-10-25 01:44:13,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:44:13,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:44:13,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:44:13,226 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:44:13,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:43:59" (1/3) ... [2018-10-25 01:44:13,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e2c27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:44:13, skipping insertion in model container [2018-10-25 01:44:13,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:44:01" (2/3) ... [2018-10-25 01:44:13,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e2c27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:44:13, skipping insertion in model container [2018-10-25 01:44:13,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:44:13" (3/3) ... [2018-10-25 01:44:13,230 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label47_true-unreach-call.c [2018-10-25 01:44:13,240 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:44:13,249 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:44:13,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:44:13,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:44:13,315 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:44:13,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:44:13,316 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:44:13,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:44:13,316 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:44:13,316 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:44:13,316 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:44:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:44:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-25 01:44:13,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:13,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:44:13,371 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:13,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1678740780, now seen corresponding path program 1 times [2018-10-25 01:44:13,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:13,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:13,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:13,862 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:44:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:13,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:13,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:44:13,970 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:13,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:44:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:44:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:44:14,000 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:44:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:26,208 INFO L93 Difference]: Finished difference Result 3104 states and 5729 transitions. [2018-10-25 01:44:26,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:44:26,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-25 01:44:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:26,244 INFO L225 Difference]: With dead ends: 3104 [2018-10-25 01:44:26,244 INFO L226 Difference]: Without dead ends: 1982 [2018-10-25 01:44:26,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:44:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2018-10-25 01:44:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1965. [2018-10-25 01:44:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2018-10-25 01:44:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3515 transitions. [2018-10-25 01:44:26,456 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 3515 transitions. Word has length 50 [2018-10-25 01:44:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:26,457 INFO L481 AbstractCegarLoop]: Abstraction has 1965 states and 3515 transitions. [2018-10-25 01:44:26,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:44:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 3515 transitions. [2018-10-25 01:44:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-25 01:44:26,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:26,472 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:44:26,472 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:26,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 307608752, now seen corresponding path program 1 times [2018-10-25 01:44:26,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:26,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:26,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:26,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:26,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:44:26,972 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:26,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:44:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:44:26,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:44:26,975 INFO L87 Difference]: Start difference. First operand 1965 states and 3515 transitions. Second operand 5 states. [2018-10-25 01:44:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:40,570 INFO L93 Difference]: Finished difference Result 5645 states and 10294 transitions. [2018-10-25 01:44:40,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:44:40,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-10-25 01:44:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:40,600 INFO L225 Difference]: With dead ends: 5645 [2018-10-25 01:44:40,600 INFO L226 Difference]: Without dead ends: 3686 [2018-10-25 01:44:40,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:44:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2018-10-25 01:44:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3654. [2018-10-25 01:44:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3654 states. [2018-10-25 01:44:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5960 transitions. [2018-10-25 01:44:40,720 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5960 transitions. Word has length 120 [2018-10-25 01:44:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:40,721 INFO L481 AbstractCegarLoop]: Abstraction has 3654 states and 5960 transitions. [2018-10-25 01:44:40,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:44:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5960 transitions. [2018-10-25 01:44:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-25 01:44:40,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:40,733 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:44:40,733 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:40,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:40,737 INFO L82 PathProgramCache]: Analyzing trace with hash 778030412, now seen corresponding path program 1 times [2018-10-25 01:44:40,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:40,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:40,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:40,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:40,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:40,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:40,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:44:40,985 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:40,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:44:40,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:44:40,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:44:40,986 INFO L87 Difference]: Start difference. First operand 3654 states and 5960 transitions. Second operand 5 states. [2018-10-25 01:44:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:59,812 INFO L93 Difference]: Finished difference Result 10942 states and 18366 transitions. [2018-10-25 01:44:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:44:59,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-10-25 01:44:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:59,856 INFO L225 Difference]: With dead ends: 10942 [2018-10-25 01:44:59,856 INFO L226 Difference]: Without dead ends: 7294 [2018-10-25 01:44:59,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:44:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2018-10-25 01:45:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7137. [2018-10-25 01:45:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7137 states. [2018-10-25 01:45:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 10864 transitions. [2018-10-25 01:45:00,088 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 10864 transitions. Word has length 122 [2018-10-25 01:45:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:00,089 INFO L481 AbstractCegarLoop]: Abstraction has 7137 states and 10864 transitions. [2018-10-25 01:45:00,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:45:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 10864 transitions. [2018-10-25 01:45:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 01:45:00,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:00,098 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:45:00,098 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:00,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1974086272, now seen corresponding path program 1 times [2018-10-25 01:45:00,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:00,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:00,100 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:00,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:00,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:45:00,269 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:00,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:45:00,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:45:00,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:45:00,271 INFO L87 Difference]: Start difference. First operand 7137 states and 10864 transitions. Second operand 3 states. [2018-10-25 01:45:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:06,534 INFO L93 Difference]: Finished difference Result 20912 states and 33132 transitions. [2018-10-25 01:45:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:45:06,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-10-25 01:45:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:06,620 INFO L225 Difference]: With dead ends: 20912 [2018-10-25 01:45:06,620 INFO L226 Difference]: Without dead ends: 13781 [2018-10-25 01:45:06,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:45:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13781 states. [2018-10-25 01:45:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13781 to 13775. [2018-10-25 01:45:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13775 states. [2018-10-25 01:45:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13775 states to 13775 states and 20149 transitions. [2018-10-25 01:45:07,219 INFO L78 Accepts]: Start accepts. Automaton has 13775 states and 20149 transitions. Word has length 144 [2018-10-25 01:45:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:07,220 INFO L481 AbstractCegarLoop]: Abstraction has 13775 states and 20149 transitions. [2018-10-25 01:45:07,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:45:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13775 states and 20149 transitions. [2018-10-25 01:45:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-25 01:45:07,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:07,235 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:45:07,236 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:07,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:07,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1974647027, now seen corresponding path program 1 times [2018-10-25 01:45:07,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:07,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:07,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:07,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:07,516 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:45:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 86 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:45:07,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:45:07,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:45:07,930 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-10-25 01:45:07,934 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2927], [2929], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3202], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3273], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:45:08,000 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:45:08,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:45:08,619 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:45:08,621 INFO L272 AbstractInterpreter]: Visited 108 different actions 108 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:45:08,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:08,664 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:45:09,305 INFO L232 lantSequenceWeakener]: Weakened 231 states. On average, predicates are now at 71.3% of their original sizes. [2018-10-25 01:45:09,305 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:45:09,569 INFO L413 sIntCurrentIteration]: We have 239 unified AI predicates [2018-10-25 01:45:09,572 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:45:09,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:45:09,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:45:09,573 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:09,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:09,575 INFO L87 Difference]: Start difference. First operand 13775 states and 20149 transitions. Second operand 6 states. [2018-10-25 01:45:14,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:45:14,855 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: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: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.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-25 01:45:14,870 INFO L168 Benchmark]: Toolchain (without parser) took 75849.28 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -626.8 MB). Peak memory consumption was 706.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:14,871 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:45:14,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2510.82 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: 245.7 MB). Peak memory consumption was 245.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:14,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 559.63 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:14,877 INFO L168 Benchmark]: Boogie Preprocessor took 293.01 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:14,880 INFO L168 Benchmark]: RCFGBuilder took 10829.28 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 174.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.1 MB). Peak memory consumption was 657.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:14,882 INFO L168 Benchmark]: TraceAbstraction took 61646.69 ms. Allocated memory was 2.6 GB in the beginning and 2.9 GB in the end (delta: 324.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.6 MB). Peak memory consumption was 486.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:45:14,889 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.20 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 2510.82 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: 245.7 MB). Peak memory consumption was 245.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 559.63 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 293.01 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10829.28 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 174.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.1 MB). Peak memory consumption was 657.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61646.69 ms. Allocated memory was 2.6 GB in the beginning and 2.9 GB in the end (delta: 324.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 161.6 MB). Peak memory consumption was 486.1 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...