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/Problem18_label04_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:03:12,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:03:12,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:03:12,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:03:12,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:03:12,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:03:12,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:03:12,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:03:12,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:03:12,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:03:12,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:03:12,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:03:12,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:03:12,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:03:12,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:03:12,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:03:12,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:03:12,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:03:12,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:03:12,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:03:12,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:03:12,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:03:12,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:03:12,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:03:12,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:03:12,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:03:12,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:03:12,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:03:12,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:03:12,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:03:12,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:03:12,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:03:12,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:03:12,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:03:12,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:03:12,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:03:12,918 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 02:03:12,941 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:03:12,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:03:12,942 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:03:12,942 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:03:12,942 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:03:12,943 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:03:12,943 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:03:12,943 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:03:12,943 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:03:12,943 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:03:12,944 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:03:12,944 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:03:12,944 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:03:12,944 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:03:12,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:03:12,945 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:03:12,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:03:12,945 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:03:12,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:03:12,946 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:03:12,946 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:03:12,946 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:03:12,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:03:12,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:03:12,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:03:12,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:03:12,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:03:12,947 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:03:12,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:03:12,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:03:12,948 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:03:12,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:03:12,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:03:12,948 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:03:12,949 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:03:12,949 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:03:12,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:03:13,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:03:13,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:03:13,011 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:03:13,012 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:03:13,013 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label04_true-unreach-call.c [2018-10-25 02:03:13,076 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6710cd66/fc2765943c0442c2b5b56075ff34f906/FLAG3c2457527 [2018-10-25 02:03:13,841 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:03:13,842 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label04_true-unreach-call.c [2018-10-25 02:03:13,869 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6710cd66/fc2765943c0442c2b5b56075ff34f906/FLAG3c2457527 [2018-10-25 02:03:13,891 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6710cd66/fc2765943c0442c2b5b56075ff34f906 [2018-10-25 02:03:13,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:03:13,907 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:03:13,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:03:13,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:03:13,916 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:03:13,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:03:13" (1/1) ... [2018-10-25 02:03:13,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d607cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:13, skipping insertion in model container [2018-10-25 02:03:13,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:03:13" (1/1) ... [2018-10-25 02:03:13,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:03:14,071 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:03:15,318 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:03:15,324 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:03:15,859 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:03:15,892 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:03:15,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15 WrapperNode [2018-10-25 02:03:15,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:03:15,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:03:15,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:03:15,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:03:15,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:15,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:16,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:03:16,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:03:16,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:03:16,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:03:16,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:16,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:16,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:16,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:16,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:16,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:16,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (1/1) ... [2018-10-25 02:03:16,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:03:16,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:03:16,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:03:16,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:03:16,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (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 02:03:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:03:16,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:03:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 02:03:16,636 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 02:03:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 02:03:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 02:03:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 02:03:16,637 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 02:03:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:03:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:03:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:03:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:03:25,862 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:03:25,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:03:25 BoogieIcfgContainer [2018-10-25 02:03:25,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:03:25,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:03:25,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:03:25,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:03:25,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:03:13" (1/3) ... [2018-10-25 02:03:25,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b40e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:03:25, skipping insertion in model container [2018-10-25 02:03:25,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:15" (2/3) ... [2018-10-25 02:03:25,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b40e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:03:25, skipping insertion in model container [2018-10-25 02:03:25,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:03:25" (3/3) ... [2018-10-25 02:03:25,872 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label04_true-unreach-call.c [2018-10-25 02:03:25,882 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:03:25,892 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:03:25,909 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:03:25,953 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:03:25,954 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:03:25,954 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:03:25,954 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:03:25,954 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:03:25,954 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:03:25,955 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:03:25,955 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:03:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-25 02:03:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-25 02:03:26,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:03:26,001 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] [2018-10-25 02:03:26,003 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:03:26,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:26,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1330496791, now seen corresponding path program 1 times [2018-10-25 02:03:26,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:03:26,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:26,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:26,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:26,062 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:03:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:26,561 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:03:26,682 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 02:03:26,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:03:26,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:03:26,685 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:03:26,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:03:26,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:03:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:03:26,710 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-10-25 02:03:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:03:33,273 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-10-25 02:03:33,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:03:33,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-10-25 02:03:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:03:33,310 INFO L225 Difference]: With dead ends: 2251 [2018-10-25 02:03:33,311 INFO L226 Difference]: Without dead ends: 1474 [2018-10-25 02:03:33,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:03:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-10-25 02:03:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-10-25 02:03:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-25 02:03:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2800 transitions. [2018-10-25 02:03:33,488 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2800 transitions. Word has length 59 [2018-10-25 02:03:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:03:33,491 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2800 transitions. [2018-10-25 02:03:33,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:03:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2800 transitions. [2018-10-25 02:03:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-25 02:03:33,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:03:33,506 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, 1, 1, 1, 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 02:03:33,507 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:03:33,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -360553496, now seen corresponding path program 1 times [2018-10-25 02:03:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:03:33,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:33,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:33,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:33,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:03:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:03:33,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:03:33,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 02:03:33,804 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:03:33,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:03:33,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:03:33,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:03:33,807 INFO L87 Difference]: Start difference. First operand 1474 states and 2800 transitions. Second operand 5 states. [2018-10-25 02:03:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:03:41,821 INFO L93 Difference]: Finished difference Result 4419 states and 8483 transitions. [2018-10-25 02:03:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:03:41,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-10-25 02:03:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:03:41,841 INFO L225 Difference]: With dead ends: 4419 [2018-10-25 02:03:41,841 INFO L226 Difference]: Without dead ends: 2951 [2018-10-25 02:03:41,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:03:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2018-10-25 02:03:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2925. [2018-10-25 02:03:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-10-25 02:03:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 5205 transitions. [2018-10-25 02:03:41,932 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 5205 transitions. Word has length 129 [2018-10-25 02:03:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:03:41,933 INFO L481 AbstractCegarLoop]: Abstraction has 2925 states and 5205 transitions. [2018-10-25 02:03:41,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:03:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 5205 transitions. [2018-10-25 02:03:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 02:03:41,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:03:41,938 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, 1, 1, 1, 1, 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 02:03:41,940 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:03:41,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1538599181, now seen corresponding path program 1 times [2018-10-25 02:03:41,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:03:41,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:41,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:41,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:41,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:03:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:03:42,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:03:42,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 02:03:42,190 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:03:42,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:03:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:03:42,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:03:42,192 INFO L87 Difference]: Start difference. First operand 2925 states and 5205 transitions. Second operand 5 states. [2018-10-25 02:03:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:03:47,963 INFO L93 Difference]: Finished difference Result 7345 states and 13001 transitions. [2018-10-25 02:03:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:03:47,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-10-25 02:03:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:03:48,000 INFO L225 Difference]: With dead ends: 7345 [2018-10-25 02:03:48,000 INFO L226 Difference]: Without dead ends: 4426 [2018-10-25 02:03:48,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:03:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2018-10-25 02:03:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 4391. [2018-10-25 02:03:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4391 states. [2018-10-25 02:03:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 6473 transitions. [2018-10-25 02:03:48,144 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 6473 transitions. Word has length 130 [2018-10-25 02:03:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:03:48,145 INFO L481 AbstractCegarLoop]: Abstraction has 4391 states and 6473 transitions. [2018-10-25 02:03:48,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:03:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 6473 transitions. [2018-10-25 02:03:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 02:03:48,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:03:48,149 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, 1, 1, 1, 1, 1, 1, 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 02:03:48,150 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:03:48,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1623571697, now seen corresponding path program 1 times [2018-10-25 02:03:48,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:03:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:48,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:48,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:48,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:03:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:03:48,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:03:48,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 02:03:48,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:03:48,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:03:48,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:03:48,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:03:48,302 INFO L87 Difference]: Start difference. First operand 4391 states and 6473 transitions. Second operand 5 states. [2018-10-25 02:03:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:03:58,987 INFO L93 Difference]: Finished difference Result 14819 states and 21982 transitions. [2018-10-25 02:03:58,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 02:03:58,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-10-25 02:03:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:03:59,045 INFO L225 Difference]: With dead ends: 14819 [2018-10-25 02:03:59,046 INFO L226 Difference]: Without dead ends: 10434 [2018-10-25 02:03:59,069 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 02:03:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10434 states. [2018-10-25 02:03:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10434 to 10284. [2018-10-25 02:03:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10284 states. [2018-10-25 02:03:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10284 states to 10284 states and 13624 transitions. [2018-10-25 02:03:59,326 INFO L78 Accepts]: Start accepts. Automaton has 10284 states and 13624 transitions. Word has length 132 [2018-10-25 02:03:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:03:59,327 INFO L481 AbstractCegarLoop]: Abstraction has 10284 states and 13624 transitions. [2018-10-25 02:03:59,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:03:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10284 states and 13624 transitions. [2018-10-25 02:03:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-25 02:03:59,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:03:59,334 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, 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] [2018-10-25 02:03:59,335 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:03:59,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:59,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1302404966, now seen corresponding path program 1 times [2018-10-25 02:03:59,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:03:59,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:59,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:59,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:59,337 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:03:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-25 02:03:59,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:03:59,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:03:59,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:03:59,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:03:59,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:03:59,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:03:59,607 INFO L87 Difference]: Start difference. First operand 10284 states and 13624 transitions. Second operand 4 states. [2018-10-25 02:04:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:04:07,004 INFO L93 Difference]: Finished difference Result 37616 states and 51784 transitions. [2018-10-25 02:04:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:04:07,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2018-10-25 02:04:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:04:07,106 INFO L225 Difference]: With dead ends: 37616 [2018-10-25 02:04:07,106 INFO L226 Difference]: Without dead ends: 27338 [2018-10-25 02:04:07,161 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 02:04:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27338 states. [2018-10-25 02:04:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27338 to 27325. [2018-10-25 02:04:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27325 states. [2018-10-25 02:04:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27325 states to 27325 states and 35001 transitions. [2018-10-25 02:04:07,717 INFO L78 Accepts]: Start accepts. Automaton has 27325 states and 35001 transitions. Word has length 236 [2018-10-25 02:04:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:04:07,717 INFO L481 AbstractCegarLoop]: Abstraction has 27325 states and 35001 transitions. [2018-10-25 02:04:07,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:04:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 27325 states and 35001 transitions. [2018-10-25 02:04:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-25 02:04:07,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:04:07,737 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:04:07,737 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:04:07,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:04:07,738 INFO L82 PathProgramCache]: Analyzing trace with hash -308767533, now seen corresponding path program 1 times [2018-10-25 02:04:07,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:04:07,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:04:07,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:04:07,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:04:07,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:04:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:04:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 233 proven. 73 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-25 02:04:08,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:04:08,340 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:04:08,341 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 337 with the following transitions: [2018-10-25 02:04:08,344 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1839], [1847], [1855], [1863], [1871], [1879], [1887], [1895], [1903], [1911], [1919], [1927], [1935], [1943], [1951], [1959], [1967], [1975], [1983], [1991], [1995], [1997], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2132], [2133], [2137], [2141], [2145], [2149], [2153], [2156], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2328], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-25 02:04:08,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:04:08,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:04:09,030 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 02:04:09,032 INFO L272 AbstractInterpreter]: Visited 129 different actions 129 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 02:04:09,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:04:09,074 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 02:04:09,752 INFO L232 lantSequenceWeakener]: Weakened 324 states. On average, predicates are now at 77.9% of their original sizes. [2018-10-25 02:04:09,753 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 02:04:10,003 INFO L413 sIntCurrentIteration]: We have 335 unified AI predicates [2018-10-25 02:04:10,003 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 02:04:10,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:04:10,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 02:04:10,005 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:04:10,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:04:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:04:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:04:10,006 INFO L87 Difference]: Start difference. First operand 27325 states and 35001 transitions. Second operand 6 states. [2018-10-25 02:05:10,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:05:10,365 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 02:05:10,370 INFO L168 Benchmark]: Toolchain (without parser) took 116464.63 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-25 02:05:10,371 INFO L168 Benchmark]: CDTParser took 0.23 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 02:05:10,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1984.97 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: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:05:10,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 446.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -930.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2018-10-25 02:05:10,374 INFO L168 Benchmark]: Boogie Preprocessor took 218.81 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: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2018-10-25 02:05:10,375 INFO L168 Benchmark]: RCFGBuilder took 9303.75 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: 520.9 MB). Peak memory consumption was 520.9 MB. Max. memory is 7.1 GB. [2018-10-25 02:05:10,375 INFO L168 Benchmark]: TraceAbstraction took 104504.79 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 2.7 GB in the end (delta: -996.5 MB). Peak memory consumption was 799.7 MB. Max. memory is 7.1 GB. [2018-10-25 02:05:10,381 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.23 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 1984.97 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: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 446.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -930.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 218.81 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: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9303.75 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: 520.9 MB). Peak memory consumption was 520.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104504.79 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 2.7 GB in the end (delta: -996.5 MB). Peak memory consumption was 799.7 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...