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/Problem17_label05_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:54:48,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:54:48,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:54:48,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:54:48,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:54:48,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:54:48,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:54:48,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:54:48,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:54:48,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:54:48,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:54:48,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:54:48,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:54:48,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:54:48,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:54:48,928 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:54:48,929 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:54:48,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:54:48,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:54:48,945 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:54:48,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:54:48,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:54:48,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:54:48,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:54:48,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:54:48,955 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:54:48,956 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:54:48,957 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:54:48,958 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:54:48,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:54:48,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:54:48,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:54:48,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:54:48,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:54:48,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:54:48,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:54:48,966 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:54:48,996 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:54:48,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:54:48,998 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:54:48,998 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:54:48,998 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:54:48,998 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:54:48,999 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:54:49,001 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:54:49,001 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:54:49,002 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:54:49,002 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:54:49,002 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:54:49,002 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:54:49,002 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:54:49,003 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:54:49,003 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:54:49,004 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:54:49,004 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:54:49,004 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:54:49,004 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:54:49,004 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:54:49,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:54:49,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:54:49,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:54:49,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:54:49,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:54:49,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:54:49,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:54:49,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:54:49,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:54:49,008 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:54:49,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:54:49,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:54:49,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:54:49,009 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:54:49,009 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:54:49,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:54:49,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:54:49,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:54:49,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:54:49,095 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:54:49,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label05_true-unreach-call.c [2018-10-25 01:54:49,172 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/821034915/c0379ce38f7248c5b63eba3dae4ddda0/FLAGa733c32f9 [2018-10-25 01:54:49,852 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:54:49,853 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label05_true-unreach-call.c [2018-10-25 01:54:49,887 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/821034915/c0379ce38f7248c5b63eba3dae4ddda0/FLAGa733c32f9 [2018-10-25 01:54:49,907 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/821034915/c0379ce38f7248c5b63eba3dae4ddda0 [2018-10-25 01:54:49,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:54:49,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:54:49,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:54:49,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:54:49,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:54:49,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:54:49" (1/1) ... [2018-10-25 01:54:49,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450bf61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:49, skipping insertion in model container [2018-10-25 01:54:49,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:54:49" (1/1) ... [2018-10-25 01:54:49,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:54:50,059 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:54:51,066 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:54:51,071 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:54:51,480 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:54:51,503 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:54:51,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51 WrapperNode [2018-10-25 01:54:51,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:54:51,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:54:51,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:54:51,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:54:51,515 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:54:51" (1/1) ... [2018-10-25 01:54:51,580 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:54:51" (1/1) ... [2018-10-25 01:54:52,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:54:52,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:54:52,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:54:52,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:54:52,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:52,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:52,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:52,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:52,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:52,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:52,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (1/1) ... [2018-10-25 01:54:52,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:54:52,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:54:52,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:54:52,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:54:52,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (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:54:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:54:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:54:52,450 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:54:52,450 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:54:52,451 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:54:52,451 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:54:52,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:54:52,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:54:52,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:54:52,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:55:03,613 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:55:03,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:55:03 BoogieIcfgContainer [2018-10-25 01:55:03,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:55:03,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:55:03,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:55:03,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:55:03,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:54:49" (1/3) ... [2018-10-25 01:55:03,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50927575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:55:03, skipping insertion in model container [2018-10-25 01:55:03,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:51" (2/3) ... [2018-10-25 01:55:03,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50927575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:55:03, skipping insertion in model container [2018-10-25 01:55:03,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:55:03" (3/3) ... [2018-10-25 01:55:03,624 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label05_true-unreach-call.c [2018-10-25 01:55:03,634 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:55:03,645 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:55:03,664 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:55:03,724 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:55:03,724 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:55:03,724 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:55:03,725 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:55:03,725 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:55:03,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:55:03,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:55:03,725 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:55:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-10-25 01:55:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-25 01:55:03,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:03,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:55:03,776 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:03,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2043862628, now seen corresponding path program 1 times [2018-10-25 01:55:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:03,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:03,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:03,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:03,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:04,347 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-25 01:55:04,370 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:55:04,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:55:04,373 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:04,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:55:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:55:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:04,400 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-10-25 01:55:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:13,577 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-10-25 01:55:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:55:13,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-10-25 01:55:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:13,633 INFO L225 Difference]: With dead ends: 2166 [2018-10-25 01:55:13,633 INFO L226 Difference]: Without dead ends: 1556 [2018-10-25 01:55:13,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-10-25 01:55:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-10-25 01:55:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-10-25 01:55:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-10-25 01:55:13,792 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 68 [2018-10-25 01:55:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:13,793 INFO L481 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-10-25 01:55:13,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:55:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-10-25 01:55:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 01:55:13,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:13,808 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, 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] [2018-10-25 01:55:13,808 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:13,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2068589566, now seen corresponding path program 1 times [2018-10-25 01:55:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:13,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:13,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:13,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:13,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:14,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:14,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:55:14,133 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:14,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:55:14,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:55:14,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:55:14,136 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-10-25 01:55:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:23,973 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-10-25 01:55:23,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:55:23,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-10-25 01:55:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:23,989 INFO L225 Difference]: With dead ends: 3059 [2018-10-25 01:55:23,990 INFO L226 Difference]: Without dead ends: 1997 [2018-10-25 01:55:23,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:55:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-10-25 01:55:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-10-25 01:55:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-10-25 01:55:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-10-25 01:55:24,079 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 144 [2018-10-25 01:55:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:24,080 INFO L481 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-10-25 01:55:24,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:55:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-10-25 01:55:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 01:55:24,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:24,094 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, 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] [2018-10-25 01:55:24,094 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:24,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1218422790, now seen corresponding path program 1 times [2018-10-25 01:55:24,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:24,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:24,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:24,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:24,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:24,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:24,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:55:24,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:24,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:55:24,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:55:24,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:55:24,316 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-10-25 01:55:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:32,040 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-10-25 01:55:32,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:55:32,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-25 01:55:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:32,063 INFO L225 Difference]: With dead ends: 4880 [2018-10-25 01:55:32,064 INFO L226 Difference]: Without dead ends: 2911 [2018-10-25 01:55:32,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:55:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-10-25 01:55:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-10-25 01:55:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-10-25 01:55:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-10-25 01:55:32,173 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 148 [2018-10-25 01:55:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:32,173 INFO L481 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-10-25 01:55:32,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:55:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-10-25 01:55:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-25 01:55:32,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:32,182 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, 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] [2018-10-25 01:55:32,182 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:32,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash -28677417, now seen corresponding path program 1 times [2018-10-25 01:55:32,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:32,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:32,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:32,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:32,184 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:32,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:55:32,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:32,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:55:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:55:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:32,417 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-10-25 01:55:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:38,474 INFO L93 Difference]: Finished difference Result 5754 states and 7882 transitions. [2018-10-25 01:55:38,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:55:38,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-10-25 01:55:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:38,488 INFO L225 Difference]: With dead ends: 5754 [2018-10-25 01:55:38,488 INFO L226 Difference]: Without dead ends: 2880 [2018-10-25 01:55:38,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-10-25 01:55:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2018-10-25 01:55:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-10-25 01:55:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3720 transitions. [2018-10-25 01:55:38,564 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3720 transitions. Word has length 178 [2018-10-25 01:55:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:38,566 INFO L481 AbstractCegarLoop]: Abstraction has 2880 states and 3720 transitions. [2018-10-25 01:55:38,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:55:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3720 transitions. [2018-10-25 01:55:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-25 01:55:38,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:38,571 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, 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, 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:55:38,571 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:38,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:38,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1314675152, now seen corresponding path program 1 times [2018-10-25 01:55:38,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:38,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:38,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-25 01:55:38,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:38,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:55:38,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:38,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:55:38,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:55:38,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:38,962 INFO L87 Difference]: Start difference. First operand 2880 states and 3720 transitions. Second operand 4 states. [2018-10-25 01:55:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:47,013 INFO L93 Difference]: Finished difference Result 11062 states and 14732 transitions. [2018-10-25 01:55:47,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:55:47,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2018-10-25 01:55:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:47,049 INFO L225 Difference]: With dead ends: 11062 [2018-10-25 01:55:47,049 INFO L226 Difference]: Without dead ends: 8188 [2018-10-25 01:55:47,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8188 states. [2018-10-25 01:55:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8188 to 8188. [2018-10-25 01:55:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8188 states. [2018-10-25 01:55:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8188 states to 8188 states and 10116 transitions. [2018-10-25 01:55:47,236 INFO L78 Accepts]: Start accepts. Automaton has 8188 states and 10116 transitions. Word has length 232 [2018-10-25 01:55:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:47,237 INFO L481 AbstractCegarLoop]: Abstraction has 8188 states and 10116 transitions. [2018-10-25 01:55:47,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:55:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8188 states and 10116 transitions. [2018-10-25 01:55:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-25 01:55:47,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:47,246 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,246 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:47,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash 495416691, now seen corresponding path program 1 times [2018-10-25 01:55:47,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:47,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:47,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 122 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:55:47,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:55:47,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:55:47,969 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-10-25 01:55:47,971 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1142], [1150], [1154], [1156], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 01:55:48,024 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:55:48,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:55:48,851 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:55:48,853 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:55:48,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:48,894 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:55:49,784 INFO L232 lantSequenceWeakener]: Weakened 246 states. On average, predicates are now at 75.81% of their original sizes. [2018-10-25 01:55:49,785 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:55:50,045 INFO L413 sIntCurrentIteration]: We have 254 unified AI predicates [2018-10-25 01:55:50,045 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:55:50,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:55:50,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:55:50,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:50,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:55:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:55:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:55:50,048 INFO L87 Difference]: Start difference. First operand 8188 states and 10116 transitions. Second operand 6 states. [2018-10-25 01:58:29,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:58:29,268 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:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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:58:29,273 INFO L168 Benchmark]: Toolchain (without parser) took 219353.24 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -914.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-25 01:58:29,275 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:58:29,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1581.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:58:29,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 553.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -907.9 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:58:29,277 INFO L168 Benchmark]: Boogie Preprocessor took 321.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:58:29,278 INFO L168 Benchmark]: RCFGBuilder took 11234.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 459.4 MB). Peak memory consumption was 459.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:58:29,279 INFO L168 Benchmark]: TraceAbstraction took 205656.62 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 2.3 GB in the end (delta: -633.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:58:29,285 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 1581.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 553.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -907.9 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 321.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11234.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 459.4 MB). Peak memory consumption was 459.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205656.62 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 2.3 GB in the end (delta: -633.1 MB). Peak memory consumption was 1.2 GB. 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...