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_label31_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:42:50,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:42:50,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:42:50,870 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:42:50,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:42:50,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:42:50,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:42:50,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:42:50,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:42:50,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:42:50,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:42:50,889 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:42:50,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:42:50,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:42:50,896 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:42:50,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:42:50,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:42:50,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:42:50,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:42:50,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:42:50,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:42:50,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:42:50,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:42:50,919 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:42:50,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:42:50,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:42:50,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:42:50,923 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:42:50,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:42:50,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:42:50,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:42:50,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:42:50,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:42:50,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:42:50,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:42:50,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:42:50,929 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:42:50,958 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:42:50,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:42:50,965 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:42:50,965 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:42:50,965 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:42:50,965 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:42:50,966 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:42:50,966 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:42:50,966 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:42:50,966 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:42:50,966 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:42:50,967 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:42:50,967 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:42:50,967 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:42:50,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:42:50,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:42:50,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:42:50,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:42:50,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:42:50,969 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:42:50,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:42:50,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:42:50,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:42:50,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:42:50,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:42:50,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:42:50,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:42:50,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:42:50,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:42:50,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:42:50,971 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:42:50,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:42:50,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:42:50,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:42:50,972 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:42:50,972 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:42:51,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:42:51,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:42:51,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:42:51,041 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:42:51,041 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:42:51,042 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label31_true-unreach-call.c [2018-10-25 01:42:51,105 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/61e1b3c71/4133aa1c66804efdb23f84f4cd62734d/FLAGc2d463f06 [2018-10-25 01:42:51,872 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:42:51,873 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label31_true-unreach-call.c [2018-10-25 01:42:51,909 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/61e1b3c71/4133aa1c66804efdb23f84f4cd62734d/FLAGc2d463f06 [2018-10-25 01:42:51,931 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/61e1b3c71/4133aa1c66804efdb23f84f4cd62734d [2018-10-25 01:42:51,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:42:51,945 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:42:51,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:42:51,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:42:51,953 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:42:51,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:42:51" (1/1) ... [2018-10-25 01:42:51,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6628d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:51, skipping insertion in model container [2018-10-25 01:42:51,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:42:51" (1/1) ... [2018-10-25 01:42:51,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:42:52,157 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:42:53,665 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:42:53,670 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:42:54,513 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:42:54,553 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:42:54,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54 WrapperNode [2018-10-25 01:42:54,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:42:54,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:42:54,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:42:54,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:42:54,567 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:42:54" (1/1) ... [2018-10-25 01:42:54,675 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:42:54" (1/1) ... [2018-10-25 01:42:55,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:42:55,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:42:55,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:42:55,180 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:42:55,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (1/1) ... [2018-10-25 01:42:55,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (1/1) ... [2018-10-25 01:42:55,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (1/1) ... [2018-10-25 01:42:55,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (1/1) ... [2018-10-25 01:42:55,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (1/1) ... [2018-10-25 01:42:55,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (1/1) ... [2018-10-25 01:42:55,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (1/1) ... [2018-10-25 01:42:55,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:42:55,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:42:55,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:42:55,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:42:55,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (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:42:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:42:55,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:42:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:42:55,585 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:42:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:42:55,586 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:42:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:42:55,586 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:42:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:42:55,586 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:42:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:42:55,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:42:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:42:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:43:07,076 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:43:07,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:43:07 BoogieIcfgContainer [2018-10-25 01:43:07,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:43:07,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:43:07,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:43:07,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:43:07,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:42:51" (1/3) ... [2018-10-25 01:43:07,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2654ca19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:43:07, skipping insertion in model container [2018-10-25 01:43:07,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:54" (2/3) ... [2018-10-25 01:43:07,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2654ca19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:43:07, skipping insertion in model container [2018-10-25 01:43:07,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:43:07" (3/3) ... [2018-10-25 01:43:07,086 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label31_true-unreach-call.c [2018-10-25 01:43:07,096 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:43:07,106 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:43:07,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:43:07,170 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:43:07,170 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:43:07,170 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:43:07,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:43:07,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:43:07,171 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:43:07,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:43:07,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:43:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:43:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-25 01:43:07,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:07,225 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] [2018-10-25 01:43:07,227 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:07,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1693652115, now seen corresponding path program 1 times [2018-10-25 01:43:07,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:07,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:07,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:07,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:07,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:07,740 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:07,890 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:43:07,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:07,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:43:07,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:07,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:43:07,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:43:07,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:43:07,936 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-25 01:43:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:17,699 INFO L93 Difference]: Finished difference Result 3093 states and 5715 transitions. [2018-10-25 01:43:17,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:43:17,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-25 01:43:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:17,741 INFO L225 Difference]: With dead ends: 3093 [2018-10-25 01:43:17,742 INFO L226 Difference]: Without dead ends: 1971 [2018-10-25 01:43:17,756 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:43:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-10-25 01:43:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1957. [2018-10-25 01:43:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1957 states. [2018-10-25 01:43:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3535 transitions. [2018-10-25 01:43:17,920 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3535 transitions. Word has length 47 [2018-10-25 01:43:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:17,921 INFO L481 AbstractCegarLoop]: Abstraction has 1957 states and 3535 transitions. [2018-10-25 01:43:17,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:43:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3535 transitions. [2018-10-25 01:43:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 01:43:17,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:17,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:17,929 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:17,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:17,930 INFO L82 PathProgramCache]: Analyzing trace with hash 459936076, now seen corresponding path program 1 times [2018-10-25 01:43:17,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:17,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:17,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:17,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:17,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:18,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:18,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:18,571 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:18,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:18,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:18,575 INFO L87 Difference]: Start difference. First operand 1957 states and 3535 transitions. Second operand 6 states. [2018-10-25 01:43:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:36,518 INFO L93 Difference]: Finished difference Result 5627 states and 10356 transitions. [2018-10-25 01:43:36,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:36,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-10-25 01:43:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:36,546 INFO L225 Difference]: With dead ends: 5627 [2018-10-25 01:43:36,547 INFO L226 Difference]: Without dead ends: 3676 [2018-10-25 01:43:36,554 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-25 01:43:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2018-10-25 01:43:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3643. [2018-10-25 01:43:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-10-25 01:43:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5987 transitions. [2018-10-25 01:43:36,686 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5987 transitions. Word has length 130 [2018-10-25 01:43:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:36,686 INFO L481 AbstractCegarLoop]: Abstraction has 3643 states and 5987 transitions. [2018-10-25 01:43:36,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:43:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5987 transitions. [2018-10-25 01:43:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-25 01:43:36,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:36,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:36,696 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:36,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash -923575044, now seen corresponding path program 1 times [2018-10-25 01:43:36,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:36,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:36,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:36,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:36,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:43:36,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:36,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:43:36,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:43:36,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:43:36,941 INFO L87 Difference]: Start difference. First operand 3643 states and 5987 transitions. Second operand 5 states. [2018-10-25 01:43:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:52,169 INFO L93 Difference]: Finished difference Result 10960 states and 18520 transitions. [2018-10-25 01:43:52,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:43:52,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2018-10-25 01:43:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:52,224 INFO L225 Difference]: With dead ends: 10960 [2018-10-25 01:43:52,224 INFO L226 Difference]: Without dead ends: 7323 [2018-10-25 01:43:52,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:43:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7323 states. [2018-10-25 01:43:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7323 to 7133. [2018-10-25 01:43:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7133 states. [2018-10-25 01:43:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 10926 transitions. [2018-10-25 01:43:52,459 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 10926 transitions. Word has length 146 [2018-10-25 01:43:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:52,460 INFO L481 AbstractCegarLoop]: Abstraction has 7133 states and 10926 transitions. [2018-10-25 01:43:52,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:43:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 10926 transitions. [2018-10-25 01:43:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-25 01:43:52,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:52,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:52,465 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:52,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:52,466 INFO L82 PathProgramCache]: Analyzing trace with hash -616934008, now seen corresponding path program 1 times [2018-10-25 01:43:52,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:52,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:52,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:52,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:52,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:52,818 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:43:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:52,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:52,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:43:52,963 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:52,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:43:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:43:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:43:52,964 INFO L87 Difference]: Start difference. First operand 7133 states and 10926 transitions. Second operand 6 states. [2018-10-25 01:44:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:04,542 INFO L93 Difference]: Finished difference Result 19767 states and 31247 transitions. [2018-10-25 01:44:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:44:04,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-10-25 01:44:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:04,614 INFO L225 Difference]: With dead ends: 19767 [2018-10-25 01:44:04,615 INFO L226 Difference]: Without dead ends: 12640 [2018-10-25 01:44:04,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:44:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12640 states. [2018-10-25 01:44:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12640 to 12438. [2018-10-25 01:44:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12438 states. [2018-10-25 01:44:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12438 states to 12438 states and 18018 transitions. [2018-10-25 01:44:04,970 INFO L78 Accepts]: Start accepts. Automaton has 12438 states and 18018 transitions. Word has length 183 [2018-10-25 01:44:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:04,971 INFO L481 AbstractCegarLoop]: Abstraction has 12438 states and 18018 transitions. [2018-10-25 01:44:04,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:44:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 12438 states and 18018 transitions. [2018-10-25 01:44:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-25 01:44:04,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:04,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,977 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:04,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:04,978 INFO L82 PathProgramCache]: Analyzing trace with hash -566668791, now seen corresponding path program 1 times [2018-10-25 01:44:04,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:04,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:04,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:04,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:04,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:05,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:44:05,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:44:05,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:05,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:05,557 INFO L87 Difference]: Start difference. First operand 12438 states and 18018 transitions. Second operand 6 states. [2018-10-25 01:44:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:24,720 INFO L93 Difference]: Finished difference Result 42938 states and 69068 transitions. [2018-10-25 01:44:24,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:44:24,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2018-10-25 01:44:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:24,905 INFO L225 Difference]: With dead ends: 42938 [2018-10-25 01:44:24,906 INFO L226 Difference]: Without dead ends: 30506 [2018-10-25 01:44:24,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:44:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30506 states. [2018-10-25 01:44:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30506 to 30268. [2018-10-25 01:44:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30268 states. [2018-10-25 01:44:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30268 states to 30268 states and 43658 transitions. [2018-10-25 01:44:26,239 INFO L78 Accepts]: Start accepts. Automaton has 30268 states and 43658 transitions. Word has length 205 [2018-10-25 01:44:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:26,240 INFO L481 AbstractCegarLoop]: Abstraction has 30268 states and 43658 transitions. [2018-10-25 01:44:26,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:44:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 30268 states and 43658 transitions. [2018-10-25 01:44:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-25 01:44:26,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:26,252 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:44:26,252 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:26,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash -620261943, now seen corresponding path program 1 times [2018-10-25 01:44:26,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:26,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:26,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 159 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:26,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:44:26,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:44:26,829 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-10-25 01:44:26,833 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], [2903], [2905], [2908], [2916], [2924], [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], [3171], [3176], [3178], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3361], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:44:26,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:44:26,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:44:27,516 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:44:27,518 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:44:27,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:27,560 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:44:28,090 INFO L232 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 71.23% of their original sizes. [2018-10-25 01:44:28,091 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:44:28,345 INFO L413 sIntCurrentIteration]: We have 250 unified AI predicates [2018-10-25 01:44:28,346 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:44:28,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:44:28,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:44:28,347 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:28,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:28,349 INFO L87 Difference]: Start difference. First operand 30268 states and 43658 transitions. Second operand 6 states. [2018-10-25 01:44:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:44:32,896 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:44:32,910 INFO L168 Benchmark]: Toolchain (without parser) took 100965.70 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -837.5 MB). Peak memory consumption was 718.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,913 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:44:32,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2607.74 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 624.59 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 837.8 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 83.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,917 INFO L168 Benchmark]: Boogie Preprocessor took 341.42 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,917 INFO L168 Benchmark]: RCFGBuilder took 11556.68 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: 20.5 MB). Peak memory consumption was 656.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,919 INFO L168 Benchmark]: TraceAbstraction took 85829.97 ms. Allocated memory was 2.6 GB in the beginning and 3.1 GB in the end (delta: 543.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -47.5 MB). Peak memory consumption was 496.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:32,930 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2607.74 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 624.59 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 837.8 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 83.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 341.42 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11556.68 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: 20.5 MB). Peak memory consumption was 656.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85829.97 ms. Allocated memory was 2.6 GB in the beginning and 3.1 GB in the end (delta: 543.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -47.5 MB). Peak memory consumption was 496.2 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...